./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R --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 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:00:46,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:00:46,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:00:46,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:00:46,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:00:46,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:00:46,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:00:46,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:00:46,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:00:46,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:00:46,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:00:46,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:00:46,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:00:46,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:00:46,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:00:46,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:00:46,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:00:46,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:00:46,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:00:46,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:00:46,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:00:46,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:00:46,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:00:46,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:00:46,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:00:46,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:00:46,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:00:46,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:00:46,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:00:46,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:00:46,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:00:46,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:00:46,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:00:46,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:00:46,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:00:46,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:00:46,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:00:46,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:00:46,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:00:46,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:00:46,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:00:46,152 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:00:46,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:00:46,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:00:46,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:00:46,223 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:00:46,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:00:46,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:00:46,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:00:46,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:00:46,225 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:00:46,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:00:46,227 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:00:46,227 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:00:46,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:00:46,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:00:46,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:00:46,228 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:00:46,228 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:00:46,228 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:00:46,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:00:46,229 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:00:46,229 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:00:46,229 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:00:46,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:00:46,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:00:46,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:00:46,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:00:46,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:00:46,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:00:46,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:00:46,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:00:46,232 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:00:46,232 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:00:46,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:00:46,233 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2022-11-25 17:00:46,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:00:46,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:00:46,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:00:46,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:00:46,596 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:00:46,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2022-11-25 17:00:49,848 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:00:50,158 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:00:50,159 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2022-11-25 17:00:50,178 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/data/d036a9b76/7a57bb767aeb41d596c13948543d4c0b/FLAG7a812e660 [2022-11-25 17:00:50,197 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/data/d036a9b76/7a57bb767aeb41d596c13948543d4c0b [2022-11-25 17:00:50,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:00:50,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:00:50,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:00:50,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:00:50,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:00:50,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:00:50" (1/1) ... [2022-11-25 17:00:50,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6f40cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:50, skipping insertion in model container [2022-11-25 17:00:50,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:00:50" (1/1) ... [2022-11-25 17:00:50,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:00:50,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:00:50,924 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2022-11-25 17:00:51,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:00:51,183 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-25 17:00:51,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1a9dfec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:51, skipping insertion in model container [2022-11-25 17:00:51,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:00:51,187 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 17:00:51,190 INFO L158 Benchmark]: Toolchain (without parser) took 978.85ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 58.0MB in the beginning and 133.2MB in the end (delta: -75.2MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-11-25 17:00:51,190 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 123.7MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:00:51,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 971.38ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 57.8MB in the beginning and 133.2MB in the end (delta: -75.4MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-11-25 17:00:51,193 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.25ms. Allocated memory is still 123.7MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 971.38ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 57.8MB in the beginning and 133.2MB in the end (delta: -75.4MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R --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 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:00:53,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:00:53,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:00:53,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:00:53,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:00:53,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:00:53,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:00:53,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:00:53,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:00:53,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:00:53,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:00:53,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:00:53,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:00:53,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:00:53,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:00:53,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:00:53,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:00:53,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:00:53,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:00:53,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:00:53,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:00:53,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:00:53,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:00:53,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:00:53,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:00:53,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:00:53,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:00:53,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:00:53,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:00:53,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:00:53,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:00:53,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:00:53,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:00:53,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:00:53,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:00:53,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:00:53,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:00:53,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:00:53,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:00:53,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:00:53,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:00:53,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:00:54,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:00:54,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:00:54,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:00:54,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:00:54,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:00:54,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:00:54,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:00:54,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:00:54,031 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:00:54,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:00:54,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:00:54,033 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:00:54,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:00:54,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:00:54,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:00:54,033 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:00:54,034 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:00:54,034 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:00:54,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:00:54,034 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:00:54,035 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:00:54,035 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:00:54,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:00:54,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:00:54,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:00:54,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:00:54,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:00:54,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:00:54,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:00:54,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:00:54,037 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:00:54,037 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:00:54,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:00:54,038 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:00:54,038 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:00:54,038 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:00:54,038 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2022-11-25 17:00:54,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:00:54,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:00:54,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:00:54,568 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:00:54,568 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:00:54,570 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2022-11-25 17:00:57,908 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:00:58,315 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:00:58,316 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2022-11-25 17:00:58,333 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/data/f0c8f17c0/096f45a31ca94d9f9222d950235623cc/FLAG6ad93570d [2022-11-25 17:00:58,357 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/data/f0c8f17c0/096f45a31ca94d9f9222d950235623cc [2022-11-25 17:00:58,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:00:58,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:00:58,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:00:58,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:00:58,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:00:58,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:00:58" (1/1) ... [2022-11-25 17:00:58,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d3a12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:58, skipping insertion in model container [2022-11-25 17:00:58,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:00:58" (1/1) ... [2022-11-25 17:00:58,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:00:58,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:00:58,976 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2022-11-25 17:00:59,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:00:59,134 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 17:00:59,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:00:59,216 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2022-11-25 17:00:59,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:00:59,317 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:00:59,349 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2022-11-25 17:00:59,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:00:59,512 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:00:59,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59 WrapperNode [2022-11-25 17:00:59,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:00:59,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:00:59,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:00:59,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:00:59,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,640 INFO L138 Inliner]: procedures = 180, calls = 349, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1158 [2022-11-25 17:00:59,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:00:59,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:00:59,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:00:59,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:00:59,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,783 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:00:59,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:00:59,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:00:59,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:00:59,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (1/1) ... [2022-11-25 17:00:59,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:00:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:00:59,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:00:59,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:00:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 17:00:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 17:00:59,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 17:00:59,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 17:00:59,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 17:00:59,915 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 17:00:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:00:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:00:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:00:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:00:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:00:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:00:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:00:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:00:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:00:59,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:01:00,258 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:01:00,273 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:01:00,277 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 17:01:06,772 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:01:06,785 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:01:06,785 INFO L300 CfgBuilder]: Removed 60 assume(true) statements. [2022-11-25 17:01:06,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:01:06 BoogieIcfgContainer [2022-11-25 17:01:06,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:01:06,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:01:06,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:01:06,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:01:06,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:00:58" (1/3) ... [2022-11-25 17:01:06,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fec671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:01:06, skipping insertion in model container [2022-11-25 17:01:06,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:59" (2/3) ... [2022-11-25 17:01:06,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fec671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:01:06, skipping insertion in model container [2022-11-25 17:01:06,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:01:06" (3/3) ... [2022-11-25 17:01:06,798 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2022-11-25 17:01:06,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:01:06,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2022-11-25 17:01:06,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:01:06,906 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@351c3e9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:01:06,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2022-11-25 17:01:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 1272 states, 611 states have (on average 2.258592471358429) internal successors, (1380), 1263 states have internal predecessors, (1380), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:01:06,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:06,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:01:06,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-25 17:01:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:06,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603889273] [2022-11-25 17:01:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:06,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:06,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:01:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:07,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:01:07,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:07,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:07,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:07,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603889273] [2022-11-25 17:01:07,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603889273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:07,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:07,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:01:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841056579] [2022-11-25 17:01:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:07,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:01:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:07,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:01:07,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:01:07,274 INFO L87 Difference]: Start difference. First operand has 1272 states, 611 states have (on average 2.258592471358429) internal successors, (1380), 1263 states have internal predecessors, (1380), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:07,375 INFO L93 Difference]: Finished difference Result 1254 states and 1326 transitions. [2022-11-25 17:01:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:01:07,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 17:01:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:07,397 INFO L225 Difference]: With dead ends: 1254 [2022-11-25 17:01:07,398 INFO L226 Difference]: Without dead ends: 1252 [2022-11-25 17:01:07,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:01:07,409 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:07,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:01:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-11-25 17:01:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2022-11-25 17:01:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 602 states have (on average 2.1461794019933556) internal successors, (1292), 1243 states have internal predecessors, (1292), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1324 transitions. [2022-11-25 17:01:07,543 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1324 transitions. Word has length 5 [2022-11-25 17:01:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:07,544 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1324 transitions. [2022-11-25 17:01:07,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1324 transitions. [2022-11-25 17:01:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:01:07,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:07,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:01:07,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:07,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:07,748 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-25 17:01:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:07,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724861493] [2022-11-25 17:01:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:07,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:07,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:07,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:07,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:01:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:07,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:01:07,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:08,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:01:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:08,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:08,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:08,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724861493] [2022-11-25 17:01:08,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724861493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:08,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:08,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:01:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654242847] [2022-11-25 17:01:08,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:08,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:01:08,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:01:08,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:08,041 INFO L87 Difference]: Start difference. First operand 1252 states and 1324 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:11,248 INFO L93 Difference]: Finished difference Result 1289 states and 1374 transitions. [2022-11-25 17:01:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:01:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 17:01:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:11,256 INFO L225 Difference]: With dead ends: 1289 [2022-11-25 17:01:11,256 INFO L226 Difference]: Without dead ends: 1289 [2022-11-25 17:01:11,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:11,258 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 1155 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:11,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 700 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 17:01:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-11-25 17:01:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1235. [2022-11-25 17:01:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 678 states have (on average 1.9675516224188792) internal successors, (1334), 1226 states have internal predecessors, (1334), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1366 transitions. [2022-11-25 17:01:11,306 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1366 transitions. Word has length 5 [2022-11-25 17:01:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:11,306 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1366 transitions. [2022-11-25 17:01:11,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1366 transitions. [2022-11-25 17:01:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:01:11,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:11,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:01:11,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:11,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:11,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:11,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-25 17:01:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:11,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498595179] [2022-11-25 17:01:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:11,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:11,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:01:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:11,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:01:11,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:11,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:01:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:11,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:11,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:11,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498595179] [2022-11-25 17:01:11,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498595179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:11,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:11,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:01:11,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142292244] [2022-11-25 17:01:11,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:11,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:01:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:01:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:11,707 INFO L87 Difference]: Start difference. First operand 1235 states and 1366 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:15,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:15,884 INFO L93 Difference]: Finished difference Result 1538 states and 1689 transitions. [2022-11-25 17:01:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:01:15,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 17:01:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:15,892 INFO L225 Difference]: With dead ends: 1538 [2022-11-25 17:01:15,893 INFO L226 Difference]: Without dead ends: 1538 [2022-11-25 17:01:15,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:15,894 INFO L413 NwaCegarLoop]: 992 mSDtfsCounter, 504 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:15,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1475 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 17:01:15,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-25 17:01:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1391. [2022-11-25 17:01:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 844 states have (on average 1.9431279620853081) internal successors, (1640), 1382 states have internal predecessors, (1640), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1672 transitions. [2022-11-25 17:01:15,969 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1672 transitions. Word has length 5 [2022-11-25 17:01:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:15,969 INFO L495 AbstractCegarLoop]: Abstraction has 1391 states and 1672 transitions. [2022-11-25 17:01:15,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1672 transitions. [2022-11-25 17:01:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 17:01:15,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:15,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 17:01:15,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:16,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:16,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-11-25 17:01:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:16,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635924654] [2022-11-25 17:01:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:16,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:16,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:16,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:01:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:16,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:01:16,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:16,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:16,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:16,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635924654] [2022-11-25 17:01:16,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635924654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:16,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:16,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:01:16,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916835979] [2022-11-25 17:01:16,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:16,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:01:16,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:01:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:16,315 INFO L87 Difference]: Start difference. First operand 1391 states and 1672 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:16,435 INFO L93 Difference]: Finished difference Result 2733 states and 3275 transitions. [2022-11-25 17:01:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:01:16,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 17:01:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:16,449 INFO L225 Difference]: With dead ends: 2733 [2022-11-25 17:01:16,450 INFO L226 Difference]: Without dead ends: 2733 [2022-11-25 17:01:16,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:16,451 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 1139 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:16,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2714 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:01:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-11-25 17:01:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 1392. [2022-11-25 17:01:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 845 states have (on average 1.9420118343195267) internal successors, (1641), 1383 states have internal predecessors, (1641), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1673 transitions. [2022-11-25 17:01:16,493 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1673 transitions. Word has length 6 [2022-11-25 17:01:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:16,494 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1673 transitions. [2022-11-25 17:01:16,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1673 transitions. [2022-11-25 17:01:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:01:16,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:16,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:16,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:16,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:16,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-25 17:01:16,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:16,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072658523] [2022-11-25 17:01:16,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:16,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:16,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:16,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:01:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:16,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:01:16,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:16,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:16,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:16,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072658523] [2022-11-25 17:01:16,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072658523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:16,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:16,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:01:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784295208] [2022-11-25 17:01:16,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:16,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:01:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:01:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:16,919 INFO L87 Difference]: Start difference. First operand 1392 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:16,963 INFO L93 Difference]: Finished difference Result 1356 states and 1636 transitions. [2022-11-25 17:01:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:01:16,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 17:01:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:16,968 INFO L225 Difference]: With dead ends: 1356 [2022-11-25 17:01:16,969 INFO L226 Difference]: Without dead ends: 1356 [2022-11-25 17:01:16,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:16,970 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 1133 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:16,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1206 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:01:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-11-25 17:01:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1350. [2022-11-25 17:01:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 827 states have (on average 1.932285368802902) internal successors, (1598), 1341 states have internal predecessors, (1598), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1630 transitions. [2022-11-25 17:01:17,001 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1630 transitions. Word has length 11 [2022-11-25 17:01:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:17,001 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1630 transitions. [2022-11-25 17:01:17,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1630 transitions. [2022-11-25 17:01:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:01:17,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:17,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:17,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:17,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:17,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-25 17:01:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:17,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301542131] [2022-11-25 17:01:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:17,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:17,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:17,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:17,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:01:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:17,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:01:17,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:17,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:17,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:17,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301542131] [2022-11-25 17:01:17,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301542131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:17,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:17,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:01:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078112894] [2022-11-25 17:01:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:17,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:01:17,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:17,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:01:17,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:01:17,451 INFO L87 Difference]: Start difference. First operand 1350 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:17,554 INFO L93 Difference]: Finished difference Result 1335 states and 1608 transitions. [2022-11-25 17:01:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:01:17,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 17:01:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:17,561 INFO L225 Difference]: With dead ends: 1335 [2022-11-25 17:01:17,561 INFO L226 Difference]: Without dead ends: 1335 [2022-11-25 17:01:17,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:17,563 INFO L413 NwaCegarLoop]: 1128 mSDtfsCounter, 1114 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:17,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2282 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:01:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-11-25 17:01:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1328. [2022-11-25 17:01:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 819 states have (on average 1.9157509157509158) internal successors, (1569), 1319 states have internal predecessors, (1569), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1601 transitions. [2022-11-25 17:01:17,595 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1601 transitions. Word has length 13 [2022-11-25 17:01:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:17,596 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 1601 transitions. [2022-11-25 17:01:17,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1601 transitions. [2022-11-25 17:01:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 17:01:17,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:17,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:17,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:17,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:17,810 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:17,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-25 17:01:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:17,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71765086] [2022-11-25 17:01:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:17,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:17,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:17,813 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:17,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:01:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:18,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:01:18,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:18,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:01:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:18,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:18,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:18,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71765086] [2022-11-25 17:01:18,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71765086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:18,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:18,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:01:18,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345789608] [2022-11-25 17:01:18,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:18,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:01:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:18,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:01:18,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:01:18,113 INFO L87 Difference]: Start difference. First operand 1328 states and 1601 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:22,336 INFO L93 Difference]: Finished difference Result 1788 states and 2048 transitions. [2022-11-25 17:01:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:01:22,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 17:01:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:22,343 INFO L225 Difference]: With dead ends: 1788 [2022-11-25 17:01:22,344 INFO L226 Difference]: Without dead ends: 1788 [2022-11-25 17:01:22,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:22,345 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 2384 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2397 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:22,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2397 Valid, 1001 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 17:01:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-11-25 17:01:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1324. [2022-11-25 17:01:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 819 states have (on average 1.910866910866911) internal successors, (1565), 1315 states have internal predecessors, (1565), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1597 transitions. [2022-11-25 17:01:22,390 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1597 transitions. Word has length 27 [2022-11-25 17:01:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:22,391 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 1597 transitions. [2022-11-25 17:01:22,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1597 transitions. [2022-11-25 17:01:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 17:01:22,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:22,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:22,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:22,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:22,612 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-25 17:01:22,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:22,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708374645] [2022-11-25 17:01:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:22,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:22,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:22,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:01:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:22,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:01:22,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:22,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:01:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:23,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:23,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:23,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708374645] [2022-11-25 17:01:23,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708374645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:23,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:23,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:01:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951546483] [2022-11-25 17:01:23,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:23,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:01:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:23,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:01:23,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:01:23,059 INFO L87 Difference]: Start difference. First operand 1324 states and 1597 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:28,289 INFO L93 Difference]: Finished difference Result 1508 states and 1671 transitions. [2022-11-25 17:01:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:01:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 17:01:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:28,294 INFO L225 Difference]: With dead ends: 1508 [2022-11-25 17:01:28,294 INFO L226 Difference]: Without dead ends: 1508 [2022-11-25 17:01:28,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:28,295 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 851 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:28,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1911 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-25 17:01:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-11-25 17:01:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1320. [2022-11-25 17:01:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 819 states have (on average 1.9059829059829059) internal successors, (1561), 1311 states have internal predecessors, (1561), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1593 transitions. [2022-11-25 17:01:28,323 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1593 transitions. Word has length 27 [2022-11-25 17:01:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:28,323 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1593 transitions. [2022-11-25 17:01:28,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1593 transitions. [2022-11-25 17:01:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 17:01:28,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:28,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:28,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:28,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-25 17:01:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:28,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714120011] [2022-11-25 17:01:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:28,541 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:28,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 17:01:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:28,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:01:28,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:28,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:28,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:28,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714120011] [2022-11-25 17:01:28,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714120011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:28,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:28,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:01:28,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382882891] [2022-11-25 17:01:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:28,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:01:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:01:28,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:01:28,876 INFO L87 Difference]: Start difference. First operand 1320 states and 1593 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:28,952 INFO L93 Difference]: Finished difference Result 1320 states and 1589 transitions. [2022-11-25 17:01:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:01:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-11-25 17:01:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:28,958 INFO L225 Difference]: With dead ends: 1320 [2022-11-25 17:01:28,959 INFO L226 Difference]: Without dead ends: 1320 [2022-11-25 17:01:28,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:28,961 INFO L413 NwaCegarLoop]: 1122 mSDtfsCounter, 1083 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:28,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 2260 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:01:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-11-25 17:01:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1314. [2022-11-25 17:01:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 813 states have (on average 1.9077490774907748) internal successors, (1551), 1305 states have internal predecessors, (1551), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1583 transitions. [2022-11-25 17:01:28,992 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1583 transitions. Word has length 42 [2022-11-25 17:01:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:28,994 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1583 transitions. [2022-11-25 17:01:28,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1583 transitions. [2022-11-25 17:01:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 17:01:28,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:29,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:29,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:29,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:29,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-25 17:01:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:29,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120373396] [2022-11-25 17:01:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:29,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:29,226 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:29,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 17:01:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:29,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:01:29,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:29,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:29,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:29,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120373396] [2022-11-25 17:01:29,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120373396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:29,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:29,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:01:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871177125] [2022-11-25 17:01:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:29,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:01:29,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:29,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:01:29,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:29,775 INFO L87 Difference]: Start difference. First operand 1314 states and 1583 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:29,877 INFO L93 Difference]: Finished difference Result 1360 states and 1629 transitions. [2022-11-25 17:01:29,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:01:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-11-25 17:01:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:29,883 INFO L225 Difference]: With dead ends: 1360 [2022-11-25 17:01:29,883 INFO L226 Difference]: Without dead ends: 1360 [2022-11-25 17:01:29,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:01:29,884 INFO L413 NwaCegarLoop]: 1130 mSDtfsCounter, 67 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:29,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2165 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:01:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-11-25 17:01:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2022-11-25 17:01:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 859 states have (on average 1.859138533178114) internal successors, (1597), 1351 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1629 transitions. [2022-11-25 17:01:29,917 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1629 transitions. Word has length 50 [2022-11-25 17:01:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:29,917 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1629 transitions. [2022-11-25 17:01:29,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1629 transitions. [2022-11-25 17:01:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 17:01:29,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:29,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:29,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:30,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:30,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:30,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-25 17:01:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:30,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083577206] [2022-11-25 17:01:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:30,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:30,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:30,143 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:30,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 17:01:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:30,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:01:30,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:30,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:01:30,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:01:31,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:01:31,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:01:31,167 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 17:01:31,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 17:01:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:31,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:31,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:31,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083577206] [2022-11-25 17:01:31,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083577206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:31,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:31,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:01:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314796509] [2022-11-25 17:01:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:31,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:01:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:01:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:01:31,198 INFO L87 Difference]: Start difference. First operand 1360 states and 1629 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:34,655 INFO L93 Difference]: Finished difference Result 1329 states and 1552 transitions. [2022-11-25 17:01:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:01:34,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-11-25 17:01:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:34,661 INFO L225 Difference]: With dead ends: 1329 [2022-11-25 17:01:34,661 INFO L226 Difference]: Without dead ends: 1329 [2022-11-25 17:01:34,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:01:34,662 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1047 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:34,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 526 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-25 17:01:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-11-25 17:01:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1110. [2022-11-25 17:01:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 693 states have (on average 1.725829725829726) internal successors, (1196), 1101 states have internal predecessors, (1196), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1228 transitions. [2022-11-25 17:01:34,697 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1228 transitions. Word has length 53 [2022-11-25 17:01:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:34,697 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1228 transitions. [2022-11-25 17:01:34,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1228 transitions. [2022-11-25 17:01:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 17:01:34,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:34,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:34,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:34,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:34,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-25 17:01:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:34,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432326657] [2022-11-25 17:01:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:34,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:34,919 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:34,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 17:01:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:35,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:01:35,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:35,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:01:35,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:01:35,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 17:01:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:35,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:35,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:35,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432326657] [2022-11-25 17:01:35,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432326657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:35,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:35,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:01:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425095517] [2022-11-25 17:01:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:35,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:01:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:35,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:01:35,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:35,310 INFO L87 Difference]: Start difference. First operand 1110 states and 1228 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:39,172 INFO L93 Difference]: Finished difference Result 1109 states and 1227 transitions. [2022-11-25 17:01:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:01:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-11-25 17:01:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:39,177 INFO L225 Difference]: With dead ends: 1109 [2022-11-25 17:01:39,177 INFO L226 Difference]: Without dead ends: 1109 [2022-11-25 17:01:39,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:01:39,178 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 4 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:39,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2633 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-25 17:01:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-25 17:01:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2022-11-25 17:01:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 693 states have (on average 1.7243867243867244) internal successors, (1195), 1100 states have internal predecessors, (1195), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1227 transitions. [2022-11-25 17:01:39,197 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1227 transitions. Word has length 58 [2022-11-25 17:01:39,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:39,197 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1227 transitions. [2022-11-25 17:01:39,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1227 transitions. [2022-11-25 17:01:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 17:01:39,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:39,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:39,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:39,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:39,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-25 17:01:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:39,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414198647] [2022-11-25 17:01:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:39,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:39,414 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:39,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 17:01:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:39,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:01:39,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:39,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:01:39,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:01:39,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:01:39,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-25 17:01:39,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 17:01:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:39,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:39,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:39,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414198647] [2022-11-25 17:01:39,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414198647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:39,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:39,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:01:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690032035] [2022-11-25 17:01:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:39,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:01:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:39,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:01:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:39,908 INFO L87 Difference]: Start difference. First operand 1109 states and 1227 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:44,830 INFO L93 Difference]: Finished difference Result 1108 states and 1226 transitions. [2022-11-25 17:01:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:01:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-11-25 17:01:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:44,835 INFO L225 Difference]: With dead ends: 1108 [2022-11-25 17:01:44,835 INFO L226 Difference]: Without dead ends: 1108 [2022-11-25 17:01:44,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:01:44,836 INFO L413 NwaCegarLoop]: 1042 mSDtfsCounter, 2 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:44,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2656 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-25 17:01:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-11-25 17:01:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2022-11-25 17:01:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 692 states have (on average 1.7254335260115607) internal successors, (1194), 1099 states have internal predecessors, (1194), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:01:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1226 transitions. [2022-11-25 17:01:44,865 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1226 transitions. Word has length 58 [2022-11-25 17:01:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:44,866 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1226 transitions. [2022-11-25 17:01:44,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:01:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1226 transitions. [2022-11-25 17:01:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 17:01:44,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:44,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:44,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:45,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:45,082 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:45,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2038939938, now seen corresponding path program 1 times [2022-11-25 17:01:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:45,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775830880] [2022-11-25 17:01:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:45,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:45,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:45,085 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:45,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 17:01:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:45,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:01:45,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:45,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:01:45,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:45,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775830880] [2022-11-25 17:01:45,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775830880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:01:45,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:01:45,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:01:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990976783] [2022-11-25 17:01:45,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:01:45,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:01:45,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:45,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:01:45,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:01:45,539 INFO L87 Difference]: Start difference. First operand 1108 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:01:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:45,624 INFO L93 Difference]: Finished difference Result 1111 states and 1231 transitions. [2022-11-25 17:01:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:01:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2022-11-25 17:01:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:45,631 INFO L225 Difference]: With dead ends: 1111 [2022-11-25 17:01:45,632 INFO L226 Difference]: Without dead ends: 1111 [2022-11-25 17:01:45,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:01:45,633 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 2 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:45,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3115 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:01:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-11-25 17:01:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2022-11-25 17:01:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 694 states have (on average 1.7247838616714697) internal successors, (1197), 1102 states have internal predecessors, (1197), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 17:01:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1231 transitions. [2022-11-25 17:01:45,656 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1231 transitions. Word has length 66 [2022-11-25 17:01:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:45,657 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1231 transitions. [2022-11-25 17:01:45,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:01:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1231 transitions. [2022-11-25 17:01:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 17:01:45,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:45,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:45,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:45,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:45,873 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:45,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2031497853, now seen corresponding path program 1 times [2022-11-25 17:01:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:45,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785466002] [2022-11-25 17:01:45,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:01:45,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:45,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:45,877 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:45,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 17:01:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:01:46,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:01:46,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:46,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:01:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:46,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:46,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785466002] [2022-11-25 17:01:46,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785466002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:01:46,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:01:46,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-25 17:01:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025180523] [2022-11-25 17:01:46,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:01:46,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:01:46,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:46,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:01:46,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:01:46,368 INFO L87 Difference]: Start difference. First operand 1111 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:01:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:46,653 INFO L93 Difference]: Finished difference Result 1123 states and 1249 transitions. [2022-11-25 17:01:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:01:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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 67 [2022-11-25 17:01:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:46,657 INFO L225 Difference]: With dead ends: 1123 [2022-11-25 17:01:46,657 INFO L226 Difference]: Without dead ends: 1123 [2022-11-25 17:01:46,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:01:46,658 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 9 mSDsluCounter, 5172 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6213 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:46,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6213 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:01:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-11-25 17:01:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1121. [2022-11-25 17:01:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 703 states have (on average 1.7240398293029873) internal successors, (1212), 1111 states have internal predecessors, (1212), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 17:01:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1246 transitions. [2022-11-25 17:01:46,679 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1246 transitions. Word has length 67 [2022-11-25 17:01:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:46,679 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1246 transitions. [2022-11-25 17:01:46,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:01:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1246 transitions. [2022-11-25 17:01:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 17:01:46,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:46,680 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:46,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-25 17:01:46,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:46,895 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash 942124702, now seen corresponding path program 2 times [2022-11-25 17:01:46,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:46,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734734064] [2022-11-25 17:01:46,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:01:46,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:46,898 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:46,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-25 17:01:47,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:01:47,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:01:47,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:01:47,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:47,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:01:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:47,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:47,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734734064] [2022-11-25 17:01:47,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734734064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:01:47,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:01:47,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-25 17:01:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052257502] [2022-11-25 17:01:47,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:01:47,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:01:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:01:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:01:47,781 INFO L87 Difference]: Start difference. First operand 1121 states and 1246 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:01:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:48,835 INFO L93 Difference]: Finished difference Result 1142 states and 1278 transitions. [2022-11-25 17:01:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 17:01:48,836 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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 70 [2022-11-25 17:01:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:48,840 INFO L225 Difference]: With dead ends: 1142 [2022-11-25 17:01:48,840 INFO L226 Difference]: Without dead ends: 1138 [2022-11-25 17:01:48,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-25 17:01:48,841 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 23 mSDsluCounter, 6232 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7276 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:48,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7276 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:01:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-11-25 17:01:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1130. [2022-11-25 17:01:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 712 states have (on average 1.7191011235955056) internal successors, (1224), 1120 states have internal predecessors, (1224), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 17:01:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1258 transitions. [2022-11-25 17:01:48,862 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1258 transitions. Word has length 70 [2022-11-25 17:01:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:48,862 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1258 transitions. [2022-11-25 17:01:48,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:01:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1258 transitions. [2022-11-25 17:01:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 17:01:48,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:48,863 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:48,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:49,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:49,080 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -795487682, now seen corresponding path program 3 times [2022-11-25 17:01:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137898217] [2022-11-25 17:01:49,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:01:49,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:49,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:49,083 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:49,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 17:01:49,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 17:01:49,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:01:50,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:01:50,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:50,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:01:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:51,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:01:51,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137898217] [2022-11-25 17:01:51,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137898217] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:01:51,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:01:51,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-25 17:01:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120096814] [2022-11-25 17:01:51,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:01:51,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 17:01:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:01:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 17:01:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:01:51,309 INFO L87 Difference]: Start difference. First operand 1130 states and 1258 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:01:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:01:56,286 INFO L93 Difference]: Finished difference Result 1172 states and 1334 transitions. [2022-11-25 17:01:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 17:01:56,286 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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 76 [2022-11-25 17:01:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:01:56,290 INFO L225 Difference]: With dead ends: 1172 [2022-11-25 17:01:56,290 INFO L226 Difference]: Without dead ends: 1166 [2022-11-25 17:01:56,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 17:01:56,291 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 49 mSDsluCounter, 12504 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 13552 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:01:56,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 13552 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 17:01:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-11-25 17:01:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1148. [2022-11-25 17:01:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 730 states have (on average 1.7082191780821918) internal successors, (1247), 1138 states have internal predecessors, (1247), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 17:01:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1281 transitions. [2022-11-25 17:01:56,317 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1281 transitions. Word has length 76 [2022-11-25 17:01:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:01:56,336 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1281 transitions. [2022-11-25 17:01:56,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:01:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1281 transitions. [2022-11-25 17:01:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 17:01:56,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:01:56,337 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:01:56,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 17:01:56,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:56,553 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:01:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:01:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash -944213634, now seen corresponding path program 4 times [2022-11-25 17:01:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:01:56,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156334105] [2022-11-25 17:01:56,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:01:56,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:01:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:01:56,556 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:01:56,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 17:01:57,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:01:57,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:01:57,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:01:57,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:01:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:01:57,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:02:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:00,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:00,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156334105] [2022-11-25 17:02:00,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156334105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:02:00,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:02:00,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-25 17:02:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726114990] [2022-11-25 17:02:00,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:02:00,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 17:02:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:02:00,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 17:02:00,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 17:02:00,309 INFO L87 Difference]: Start difference. First operand 1148 states and 1281 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:02:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:14,983 INFO L93 Difference]: Finished difference Result 1228 states and 1414 transitions. [2022-11-25 17:02:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-25 17:02:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 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 88 [2022-11-25 17:02:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:14,989 INFO L225 Difference]: With dead ends: 1228 [2022-11-25 17:02:14,989 INFO L226 Difference]: Without dead ends: 1224 [2022-11-25 17:02:14,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-25 17:02:14,993 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 78 mSDsluCounter, 24293 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 25354 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:14,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 25354 Invalid, 3117 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [93 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-25 17:02:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-11-25 17:02:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1182. [2022-11-25 17:02:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 764 states have (on average 1.692408376963351) internal successors, (1293), 1172 states have internal predecessors, (1293), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 17:02:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1327 transitions. [2022-11-25 17:02:15,020 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1327 transitions. Word has length 88 [2022-11-25 17:02:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:15,021 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1327 transitions. [2022-11-25 17:02:15,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:02:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1327 transitions. [2022-11-25 17:02:15,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-25 17:02:15,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:15,022 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:15,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:15,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:15,239 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:02:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1478038498, now seen corresponding path program 5 times [2022-11-25 17:02:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:02:15,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957677994] [2022-11-25 17:02:15,240 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:02:15,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:02:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:02:15,241 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:02:15,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-25 17:02:16,869 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-25 17:02:16,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:02:16,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 17:02:16,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:16,938 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 17:02:16,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2022-11-25 17:02:17,489 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-25 17:02:17,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-11-25 17:02:17,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:02:17,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-25 17:02:18,162 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1564)))) is different from true [2022-11-25 17:02:19,021 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1581)))) is different from true [2022-11-25 17:02:19,370 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1589)))) is different from true [2022-11-25 17:02:20,030 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_11))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1603)))) is different from true [2022-11-25 17:02:20,178 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:02:20,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-25 17:02:20,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2022-11-25 17:02:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-25 17:02:20,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:02:22,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:02:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957677994] [2022-11-25 17:02:22,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957677994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:02:22,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1141625661] [2022-11-25 17:02:22,854 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:02:22,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 17:02:22,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 17:02:22,857 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 17:02:22,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-25 17:03:36,648 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-25 17:03:36,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:03:36,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 17:03:36,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:03:36,999 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 17:03:36,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 17:03:37,477 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-25 17:03:37,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 17:03:37,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:03:37,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-11-25 17:03:42,322 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:03:42,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:03:42,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-11-25 17:03:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 17:03:42,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:03:42,949 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 17:03:42,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1141625661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:42,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:03:42,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 20 [2022-11-25 17:03:42,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518253506] [2022-11-25 17:03:42,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:03:42,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 17:03:42,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:03:42,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 17:03:42,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=337, Unknown=31, NotChecked=210, Total=650 [2022-11-25 17:03:42,954 INFO L87 Difference]: Start difference. First operand 1182 states and 1327 transitions. Second operand has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:04:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:04:12,513 INFO L93 Difference]: Finished difference Result 2281 states and 2468 transitions. [2022-11-25 17:04:12,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 17:04:12,515 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-11-25 17:04:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:04:12,532 INFO L225 Difference]: With dead ends: 2281 [2022-11-25 17:04:12,532 INFO L226 Difference]: Without dead ends: 2273 [2022-11-25 17:04:12,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 118 SyntacticMatches, 86 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=258, Invalid=1242, Unknown=80, NotChecked=400, Total=1980 [2022-11-25 17:04:12,534 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 4479 mSDsluCounter, 5462 mSDsCounter, 0 mSdLazyCounter, 6340 mSolverCounterSat, 168 mSolverCounterUnsat, 1884 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4479 SdHoareTripleChecker+Valid, 5977 SdHoareTripleChecker+Invalid, 16847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 6340 IncrementalHoareTripleChecker+Invalid, 1884 IncrementalHoareTripleChecker+Unknown, 8455 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:04:12,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4479 Valid, 5977 Invalid, 16847 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [168 Valid, 6340 Invalid, 1884 Unknown, 8455 Unchecked, 27.7s Time] [2022-11-25 17:04:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2022-11-25 17:04:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1230. [2022-11-25 17:04:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 812 states have (on average 1.6514778325123152) internal successors, (1341), 1219 states have internal predecessors, (1341), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-25 17:04:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1375 transitions. [2022-11-25 17:04:12,561 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1375 transitions. Word has length 110 [2022-11-25 17:04:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:04:12,562 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1375 transitions. [2022-11-25 17:04:12,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.368421052631579) internal successors, (140), 21 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:04:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1375 transitions. [2022-11-25 17:04:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-25 17:04:12,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:04:12,563 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:04:12,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-25 17:04:12,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2022-11-25 17:04:12,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 17:04:12,985 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:04:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:04:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1478038497, now seen corresponding path program 1 times [2022-11-25 17:04:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:04:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562845422] [2022-11-25 17:04:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:04:12,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:04:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:04:12,987 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:04:12,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 17:04:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:13,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-25 17:04:13,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:04:13,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:04:14,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:04:14,265 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 17:04:14,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 17:04:14,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:04:14,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:04:14,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-25 17:04:14,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 17:04:14,571 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-11-25 17:04:14,591 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459)))) is different from true [2022-11-25 17:04:14,607 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461)))) is different from true [2022-11-25 17:04:14,628 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463)))) is different from true [2022-11-25 17:04:14,645 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-11-25 17:04:14,661 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467)))) is different from true [2022-11-25 17:04:14,675 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:14,692 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:14,798 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476)))) is different from true [2022-11-25 17:04:14,813 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479)))) is different from true [2022-11-25 17:04:14,829 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:14,882 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-11-25 17:04:14,932 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489)))) is different from true [2022-11-25 17:04:14,950 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490)))) is different from true [2022-11-25 17:04:14,965 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:14,979 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-11-25 17:04:14,995 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:04:15,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:04:15,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-11-25 17:04:15,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-11-25 17:04:15,061 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504)))) is different from true [2022-11-25 17:04:15,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:15,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:15,106 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-11-25 17:04:15,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-11-25 17:04:15,141 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:15,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516)))) is different from true [2022-11-25 17:04:15,174 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-11-25 17:04:15,191 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520)))) is different from true [2022-11-25 17:04:15,208 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:15,225 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524)))) is different from true [2022-11-25 17:04:15,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:04:15,261 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:04:15,280 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-11-25 17:04:15,298 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-11-25 17:04:15,316 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-11-25 17:04:15,333 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-11-25 17:04:15,350 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538)))) is different from true [2022-11-25 17:04:15,381 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:04:15,398 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542)))) is different from true [2022-11-25 17:04:15,457 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:04:15,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:04:15,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:04:15,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 17:04:15,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 17:04:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2022-11-25 17:04:15,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:04:16,787 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 17:04:16,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:04:16,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562845422] [2022-11-25 17:04:16,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562845422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:04:16,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [549282201] [2022-11-25 17:04:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:04:16,796 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 17:04:16,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 17:04:16,798 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 17:04:16,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-25 17:06:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:00,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-25 17:06:00,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:00,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:06:00,871 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 17:06:00,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 17:06:00,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:06:00,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:06:00,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:06:01,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 17:06:01,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 17:06:01,259 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2995) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:06:01,346 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000)))) is different from true [2022-11-25 17:06:01,359 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:06:01,371 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3004)))) is different from true [2022-11-25 17:06:01,385 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007)))) is different from true [2022-11-25 17:06:01,398 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008)))) is different from true [2022-11-25 17:06:01,411 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3011))) (exists ((v_ArrVal_3010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3010)))) is different from true [2022-11-25 17:06:01,427 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3012))) (exists ((v_ArrVal_3013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3013)))) is different from true [2022-11-25 17:06:01,445 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3015))) (exists ((v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3014)))) is different from true [2022-11-25 17:06:01,458 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3017))) (exists ((v_ArrVal_3016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3016)))) is different from true [2022-11-25 17:06:01,471 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3019) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3018)))) is different from true [2022-11-25 17:06:01,484 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3020))) (exists ((v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3021)))) is different from true [2022-11-25 17:06:01,497 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3023) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3022)))) is different from true [2022-11-25 17:06:01,509 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3024 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3024) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3025)))) is different from true [2022-11-25 17:06:01,522 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3026) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3027) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:06:01,535 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3029) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:06:01,549 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3030))) (exists ((v_ArrVal_3031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3031) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:06:01,596 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034)))) is different from true [2022-11-25 17:06:01,644 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:06:01,657 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:06:01,669 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043)))) is different from true [2022-11-25 17:06:01,682 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044)))) is different from true [2022-11-25 17:06:01,728 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:01,740 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050)))) is different from true [2022-11-25 17:06:01,790 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055)))) is different from true [2022-11-25 17:06:01,803 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:06:01,849 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060)))) is different from true [2022-11-25 17:06:01,905 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064)))) is different from true [2022-11-25 17:06:01,962 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:06:01,977 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070)))) is different from true [2022-11-25 17:06:02,019 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072)))) is different from true [2022-11-25 17:06:02,108 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078)))) is different from true [2022-11-25 17:06:02,122 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081)))) is different from true [2022-11-25 17:06:02,170 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:06:02,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:06:02,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:06:02,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 17:06:02,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 17:06:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 924 not checked. [2022-11-25 17:06:02,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:03,209 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3173 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-25 17:06:03,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [549282201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:03,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:03,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 41] total 85 [2022-11-25 17:06:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025929283] [2022-11-25 17:06:03,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:03,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-11-25 17:06:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:06:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-11-25 17:06:03,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=237, Unknown=84, NotChecked=7500, Total=8010 [2022-11-25 17:06:03,219 INFO L87 Difference]: Start difference. First operand 1230 states and 1375 transitions. Second operand has 86 states, 83 states have (on average 2.5180722891566263) internal successors, (209), 86 states have internal predecessors, (209), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:06:04,403 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,414 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_3005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3004))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,441 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_3005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3004))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_3005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3004))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,468 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_3005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3004))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3011))) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_3010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3010))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3012))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_3005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3004))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_3013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3013))) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3011))) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_3010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3010))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,495 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3012))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3015))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3014))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_3005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3004))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_3013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3013))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3011))) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_3010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3010))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,509 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3009))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_3002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3002))) (exists ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3012))) (exists ((v_ArrVal_3006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3006) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3015))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_3017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3017))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3014))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_3005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3001))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3008))) (exists ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3000))) (exists ((v_ArrVal_3004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3004))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045))) (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_3013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3013))) (exists ((v_ArrVal_3016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3016))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072))) (exists ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3035))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3011))) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_3007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3007))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_3010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3010))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064))) (exists ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3034))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049)))) is different from true [2022-11-25 17:06:04,723 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472))) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081)))) is different from true [2022-11-25 17:06:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:06:26,152 INFO L93 Difference]: Finished difference Result 1981 states and 2126 transitions. [2022-11-25 17:06:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 17:06:26,153 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 83 states have (on average 2.5180722891566263) internal successors, (209), 86 states have internal predecessors, (209), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-11-25 17:06:26,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:06:26,158 INFO L225 Difference]: With dead ends: 1981 [2022-11-25 17:06:26,159 INFO L226 Difference]: Without dead ends: 1981 [2022-11-25 17:06:26,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 121 SyntacticMatches, 19 SemanticMatches, 104 ConstructedPredicates, 85 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=256, Invalid=404, Unknown=100, NotChecked=10370, Total=11130 [2022-11-25 17:06:26,162 INFO L413 NwaCegarLoop]: 836 mSDtfsCounter, 1626 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 7612 mSolverCounterSat, 21 mSolverCounterUnsat, 652 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 128325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 7612 IncrementalHoareTripleChecker+Invalid, 652 IncrementalHoareTripleChecker+Unknown, 120040 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:06:26,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 4045 Invalid, 128325 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 7612 Invalid, 652 Unknown, 120040 Unchecked, 22.0s Time] [2022-11-25 17:06:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2022-11-25 17:06:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1244. [2022-11-25 17:06:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 825 states have (on average 1.652121212121212) internal successors, (1363), 1232 states have internal predecessors, (1363), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (19), 8 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-25 17:06:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1398 transitions. [2022-11-25 17:06:26,185 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1398 transitions. Word has length 110 [2022-11-25 17:06:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:06:26,185 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1398 transitions. [2022-11-25 17:06:26,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 83 states have (on average 2.5180722891566263) internal successors, (209), 86 states have internal predecessors, (209), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:06:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1398 transitions. [2022-11-25 17:06:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 17:06:26,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:06:26,187 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:26,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:26,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-25 17:06:26,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 17:06:26,604 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:06:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash -239903209, now seen corresponding path program 1 times [2022-11-25 17:06:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:06:26,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571621940] [2022-11-25 17:06:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:26,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:06:26,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:06:26,607 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:06:26,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-25 17:06:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:27,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 17:06:27,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:27,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:06:27,699 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 17:06:27,699 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 27 [2022-11-25 17:06:27,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:06:27,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 17:06:29,882 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:06:29,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 17:06:30,012 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:06:30,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 17:06:30,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 17:06:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 17:06:30,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:30,149 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2022-11-25 17:06:30,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3626))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3580)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 17:06:30,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:06:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571621940] [2022-11-25 17:06:30,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571621940] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [209136373] [2022-11-25 17:06:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 17:06:30,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 17:06:30,569 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 17:06:30,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-25 17:06:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:34,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 17:06:34,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:34,661 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 17:06:34,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 17:06:35,010 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-25 17:06:35,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 17:06:35,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:06:35,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-11-25 17:06:38,667 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:06:38,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:06:38,885 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:06:38,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:06:38,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-11-25 17:06:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 17:06:39,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:06:39,023 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4033) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 17:06:39,036 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 17:06:39,349 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4033)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 17:06:39,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [209136373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:06:39,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:06:39,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2022-11-25 17:06:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573392621] [2022-11-25 17:06:39,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:06:39,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:06:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:06:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:06:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=350, Unknown=32, NotChecked=220, Total=702 [2022-11-25 17:06:39,355 INFO L87 Difference]: Start difference. First operand 1244 states and 1398 transitions. Second operand has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:07:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:07:04,869 INFO L93 Difference]: Finished difference Result 2299 states and 2500 transitions. [2022-11-25 17:07:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 17:07:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-11-25 17:07:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:07:04,875 INFO L225 Difference]: With dead ends: 2299 [2022-11-25 17:07:04,876 INFO L226 Difference]: Without dead ends: 2299 [2022-11-25 17:07:04,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 125 SyntacticMatches, 88 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=157, Invalid=578, Unknown=41, NotChecked=280, Total=1056 [2022-11-25 17:07:04,877 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 1746 mSDsluCounter, 5855 mSDsCounter, 0 mSdLazyCounter, 7043 mSolverCounterSat, 38 mSolverCounterUnsat, 1930 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 6387 SdHoareTripleChecker+Invalid, 9011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 7043 IncrementalHoareTripleChecker+Invalid, 1930 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:07:04,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 6387 Invalid, 9011 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 7043 Invalid, 1930 Unknown, 0 Unchecked, 25.0s Time] [2022-11-25 17:07:04,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2022-11-25 17:07:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 1243. [2022-11-25 17:07:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 825 states have (on average 1.6509090909090909) internal successors, (1362), 1231 states have internal predecessors, (1362), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (19), 8 states have call predecessors, (19), 16 states have call successors, (19) [2022-11-25 17:07:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1397 transitions. [2022-11-25 17:07:04,901 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1397 transitions. Word has length 113 [2022-11-25 17:07:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:07:04,902 INFO L495 AbstractCegarLoop]: Abstraction has 1243 states and 1397 transitions. [2022-11-25 17:07:04,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.625) internal successors, (138), 19 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:07:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1397 transitions. [2022-11-25 17:07:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 17:07:04,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:07:04,903 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:04,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:05,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-25 17:07:05,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 17:07:05,324 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-11-25 17:07:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash -239903208, now seen corresponding path program 1 times [2022-11-25 17:07:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:07:05,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522895035] [2022-11-25 17:07:05,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:05,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:07:05,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:07:05,326 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:07:05,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-25 17:07:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:06,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 17:07:06,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:07:06,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:07:06,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:07:06,476 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 17:07:06,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 17:07:06,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:07:06,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:07:06,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 17:07:06,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 17:07:06,729 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4445))) (exists ((v_ArrVal_4444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4444)))) is different from true [2022-11-25 17:07:06,744 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4447))) (exists ((v_ArrVal_4446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4446) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:07:06,758 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4449) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4448)))) is different from true [2022-11-25 17:07:06,819 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452)))) is different from true [2022-11-25 17:07:06,834 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455)))) is different from true [2022-11-25 17:07:06,848 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457)))) is different from true [2022-11-25 17:07:06,875 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:07:06,890 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460)))) is different from true [2022-11-25 17:07:06,905 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:07:06,920 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:07:07,008 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471)))) is different from true [2022-11-25 17:07:07,059 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:07:07,074 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:07:07,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:07:07,104 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:07:07,119 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483)))) is different from true [2022-11-25 17:07:07,134 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485)))) is different from true [2022-11-25 17:07:07,149 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487)))) is different from true [2022-11-25 17:07:07,164 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-25 17:07:07,179 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491))) (exists ((v_ArrVal_4490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4490) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:07:07,194 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4492))) (exists ((v_ArrVal_4493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4493) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:07:07,209 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495)))) is different from true [2022-11-25 17:07:07,224 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496)))) is different from true [2022-11-25 17:07:07,239 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499)))) is different from true [2022-11-25 17:07:07,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501)))) is different from true [2022-11-25 17:07:07,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4503))) (exists ((v_ArrVal_4502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4502) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:07:07,284 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4504) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4505)))) is different from true [2022-11-25 17:07:07,298 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4507))) (exists ((v_ArrVal_4506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4506)))) is different from true [2022-11-25 17:07:07,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4509) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4508)))) is different from true [2022-11-25 17:07:07,328 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4511))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4510)))) is different from true [2022-11-25 17:07:07,343 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4512))) (exists ((v_ArrVal_4513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4513)))) is different from true [2022-11-25 17:07:07,357 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4514) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4515) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:07:07,372 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4516))) (exists ((v_ArrVal_4517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4517)))) is different from true [2022-11-25 17:07:07,387 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4519))) (exists ((v_ArrVal_4518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4518)))) is different from true [2022-11-25 17:07:07,401 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4520) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4521)))) is different from true [2022-11-25 17:07:07,414 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4523) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4522)))) is different from true [2022-11-25 17:07:07,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4525))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4524)))) is different from true [2022-11-25 17:07:07,443 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4526)))) is different from true [2022-11-25 17:07:07,459 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4528 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4528))) (exists ((v_ArrVal_4529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4529)))) is different from true [2022-11-25 17:07:07,474 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4531))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4530)))) is different from true [2022-11-25 17:07:07,526 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:07:07,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:07:07,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:07:07,675 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:07:07,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:07:07,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:07:07,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 17:07:07,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 17:07:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2022-11-25 17:07:07,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:07:07,963 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-25 17:07:08,005 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-25 17:07:09,089 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4624) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4625) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4625))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4624) .cse2 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 17:07:09,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:07:09,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522895035] [2022-11-25 17:07:09,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522895035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:07:09,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [206368931] [2022-11-25 17:07:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:09,101 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 17:07:09,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 17:07:09,103 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 17:07:09,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b974a57d-38bf-4faa-8e94-a7fcd6e0cfe0/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-25 17:09:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:17,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-25 17:09:17,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:17,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 17:09:17,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:09:17,763 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 17:09:17,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 17:09:17,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:09:17,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:09:17,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 17:09:17,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 17:09:17,939 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990)))) is different from true [2022-11-25 17:09:17,959 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4993))) (exists ((v_ArrVal_4992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4992)))) is different from true [2022-11-25 17:09:17,978 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4995))) (exists ((v_ArrVal_4994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4994) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:09:17,996 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4997))) (exists ((v_ArrVal_4996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4996) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:09:18,014 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998)))) is different from true [2022-11-25 17:09:18,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32)))) is different from true [2022-11-25 17:09:18,049 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003)))) is different from true [2022-11-25 17:09:18,066 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5005))) (exists ((v_ArrVal_5004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5004) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:18,083 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5007))) (exists ((v_ArrVal_5006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5006)))) is different from true [2022-11-25 17:09:18,098 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008)))) is different from true [2022-11-25 17:09:18,120 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5010) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:18,139 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5013))) (exists ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5012)))) is different from true [2022-11-25 17:09:18,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5014))) (exists ((v_ArrVal_5015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5015)))) is different from true [2022-11-25 17:09:18,178 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5016) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5017)))) is different from true [2022-11-25 17:09:18,198 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5018) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:09:18,218 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5021))) (exists ((v_ArrVal_5020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5020)))) is different from true [2022-11-25 17:09:18,237 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5023) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5022) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:18,256 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5024))) (exists ((v_ArrVal_5025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5025)))) is different from true [2022-11-25 17:09:18,275 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5026))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5027 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5027)))) is different from true [2022-11-25 17:09:18,294 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5029) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5028 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5028)))) is different from true [2022-11-25 17:09:18,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5031) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5030)))) is different from true [2022-11-25 17:09:18,334 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5032))) (exists ((v_ArrVal_5033 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5033)))) is different from true [2022-11-25 17:09:18,351 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5034))) (exists ((v_ArrVal_5035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5035)))) is different from true [2022-11-25 17:09:18,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5036))) (exists ((v_ArrVal_5037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5037)))) is different from true [2022-11-25 17:09:18,387 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5039) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5038)))) is different from true [2022-11-25 17:09:18,405 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5041)))) is different from true [2022-11-25 17:09:18,423 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043))) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:09:18,440 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5044 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5044) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5045)))) is different from true [2022-11-25 17:09:18,457 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (exists ((v_ArrVal_5047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5047)))) is different from true [2022-11-25 17:09:18,472 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5048) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5049) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:18,487 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5050) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5051) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:09:18,502 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5053) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5052) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:18,516 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5055))) (exists ((v_ArrVal_5054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5054) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:09:18,530 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5057) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5056)))) is different from true [2022-11-25 17:09:18,545 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058))) (exists ((v_ArrVal_5059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5059) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:18,575 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5061))) (exists ((v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5060)))) is different from true [2022-11-25 17:09:18,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5062))) (exists ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5063)))) is different from true [2022-11-25 17:09:18,610 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5064)))) is different from true [2022-11-25 17:09:18,626 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5066))) (exists ((v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5067)))) is different from true [2022-11-25 17:09:18,641 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5068) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5069)))) is different from true [2022-11-25 17:09:18,655 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5071) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5070) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:18,668 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5072))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5073) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:09:18,683 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5075) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5074)))) is different from true [2022-11-25 17:09:18,698 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5076))) (exists ((v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5077)))) is different from true [2022-11-25 17:09:18,752 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:09:18,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:09:18,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:09:18,849 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 17:09:18,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 17:09:18,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:09:18,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 17:09:18,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 17:09:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-25 17:09:18,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:18,980 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 17:09:19,032 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 17:09:20,226 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5078 (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~mem33#1.base| v_ArrVal_5170))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5171) .cse0 v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5078 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5171) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-25 17:09:20,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [206368931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:20,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:20,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 52] total 93 [2022-11-25 17:09:20,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263124892] [2022-11-25 17:09:20,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:20,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-11-25 17:09:20,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:09:20,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-11-25 17:09:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=188, Unknown=97, NotChecked=9810, Total=10302 [2022-11-25 17:09:20,240 INFO L87 Difference]: Start difference. First operand 1243 states and 1397 transitions. Second operand has 94 states, 92 states have (on average 1.7065217391304348) internal successors, (157), 94 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:09:21,639 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4445))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990))) (exists ((v_ArrVal_4444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4444))) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:21,658 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4447))) (exists ((v_ArrVal_4993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4993))) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4446) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4992))) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471)))) is different from true [2022-11-25 17:09:21,665 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4449) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4448))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4995))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:21,672 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4997))) (exists ((v_ArrVal_4996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4996) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 17:09:21,681 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998)))) is different from true [2022-11-25 17:09:21,689 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:21,699 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002))) (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:21,711 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_5005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5005))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_5004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5004) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 17:09:21,722 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5007))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_5006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5006))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-25 17:09:21,848 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487))) (exists ((v_ArrVal_4492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4492))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4493) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4490) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5010) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-25 17:09:21,860 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487))) (exists ((v_ArrVal_4492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4492))) (exists ((v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5013))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5012))) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4493) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4490) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-25 17:09:21,872 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487))) (exists ((v_ArrVal_4492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4492))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491))) (exists ((v_ArrVal_5014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5014))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495))) (exists ((v_ArrVal_5015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5015))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4493) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4490) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-25 17:09:21,884 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487))) (exists ((v_ArrVal_4492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4492))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5016) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495))) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4493) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4490) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_5017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5017))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499))) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-25 17:09:21,898 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487))) (exists ((v_ArrVal_4492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4492))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495))) (exists ((v_ArrVal_5019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_5018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5018) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4493) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4490) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499))) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501))) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-25 17:09:21,913 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4458))) (exists ((v_ArrVal_4454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4454))) (exists ((v_ArrVal_4486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4484))) (exists ((v_arrayElimCell_53 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_53) (_ bv44 32))) (exists ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4487))) (exists ((v_ArrVal_4492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4492))) (exists ((v_ArrVal_5021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5021))) (exists ((v_ArrVal_5020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5020))) (exists ((v_ArrVal_4453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4453))) (exists ((v_ArrVal_4450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4450))) (exists ((v_ArrVal_4494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4494))) (exists ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4491))) (exists ((v_ArrVal_4482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4482) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4503))) (exists ((v_ArrVal_4480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4480))) (exists ((v_ArrVal_4497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4497))) (exists ((v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4495))) (exists ((v_ArrVal_4498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4498))) (exists ((v_ArrVal_4477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4477) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4474))) (exists ((v_ArrVal_4452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4452))) (exists ((v_ArrVal_4500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4500))) (exists ((v_ArrVal_4493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4493) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4478))) (exists ((v_ArrVal_4489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4489))) (exists ((v_ArrVal_4490 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4490) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4462))) (exists ((v_ArrVal_4470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4502) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4464) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4496))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4499))) (exists ((v_ArrVal_4459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4459) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4483))) (exists ((v_ArrVal_4455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4455))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457))) (exists ((v_ArrVal_4461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4461) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4471))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460))) (exists ((v_ArrVal_4476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4479) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4501))) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4488)))) is different from true [2022-11-25 17:09:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:41,363 INFO L93 Difference]: Finished difference Result 1371 states and 1540 transitions. [2022-11-25 17:09:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:09:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 92 states have (on average 1.7065217391304348) internal successors, (157), 94 states have internal predecessors, (157), 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 113 [2022-11-25 17:09:41,364 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-25 17:09:41,365 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 92 states have (on average 1.7065217391304348) internal successors, (157), 94 states have internal predecessors, (157), 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 113