./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 --- 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-5e519f3 [2022-11-03 02:53:33,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:53:33,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:53:33,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:53:33,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:53:33,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:53:33,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:53:33,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:53:33,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:53:33,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:53:33,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:53:33,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:53:33,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:53:33,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:53:33,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:53:33,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:53:33,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:53:33,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:53:33,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:53:33,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:53:33,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:53:33,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:53:33,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:53:33,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:53:33,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:53:33,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:53:33,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:53:33,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:53:33,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:53:33,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:53:33,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:53:33,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:53:33,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:53:33,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:53:33,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:53:33,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:53:33,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:53:33,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:53:33,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:53:33,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:53:33,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:53:33,157 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 02:53:33,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:53:33,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:53:33,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:53:33,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:53:33,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:53:33,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:53:33,199 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:53:33,199 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:53:33,199 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:53:33,200 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:53:33,200 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:53:33,200 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:53:33,200 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:53:33,200 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:53:33,206 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:53:33,207 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:53:33,207 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:53:33,207 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:53:33,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:53:33,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:53:33,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:53:33,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:53:33,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:53:33,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:53:33,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:53:33,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:53:33,209 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:53:33,210 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:53:33,210 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 02:53:33,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:53:33,211 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:53:33,211 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:53:33,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:53:33,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:53:33,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:53:33,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:53:33,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:53:33,213 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:53:33,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:53:33,213 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:53:33,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:53:33,214 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:53:33,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/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_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 [2022-11-03 02:53:33,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:53:33,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:53:33,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:53:33,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:53:33,516 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:53:33,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2022-11-03 02:53:33,594 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data/f3cd7a394/321d88052817447e98d3f0f0739c5d3f/FLAGc36668699 [2022-11-03 02:53:34,216 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:53:34,217 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2022-11-03 02:53:34,238 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data/f3cd7a394/321d88052817447e98d3f0f0739c5d3f/FLAGc36668699 [2022-11-03 02:53:34,463 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data/f3cd7a394/321d88052817447e98d3f0f0739c5d3f [2022-11-03 02:53:34,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:53:34,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:53:34,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:53:34,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:53:34,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:53:34,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:53:34" (1/1) ... [2022-11-03 02:53:34,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed5a52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:34, skipping insertion in model container [2022-11-03 02:53:34,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:53:34" (1/1) ... [2022-11-03 02:53:34,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:53:34,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:53:35,009 WARN L230 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_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[33021,33034] [2022-11-03 02:53:35,206 WARN L230 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_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[49681,49694] [2022-11-03 02:53:35,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:53:35,232 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-03 02:53:35,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a7510da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:35, skipping insertion in model container [2022-11-03 02:53:35,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:53:35,234 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-03 02:53:35,235 INFO L158 Benchmark]: Toolchain (without parser) took 767.89ms. Allocated memory is still 115.3MB. Free memory was 77.0MB in the beginning and 75.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:53:35,236 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:53:35,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.15ms. Allocated memory is still 115.3MB. Free memory was 76.7MB in the beginning and 75.8MB in the end (delta: 893.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:53:35,239 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.24ms. Allocated memory is still 115.3MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.15ms. Allocated memory is still 115.3MB. Free memory was 76.7MB in the beginning and 75.8MB in the end (delta: 893.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 --- 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-5e519f3 [2022-11-03 02:53:37,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:53:37,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:53:37,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:53:37,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:53:37,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:53:37,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:53:37,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:53:37,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:53:37,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:53:37,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:53:37,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:53:37,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:53:37,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:53:37,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:53:37,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:53:37,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:53:37,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:53:37,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:53:37,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:53:37,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:53:37,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:53:37,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:53:37,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:53:37,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:53:37,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:53:37,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:53:37,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:53:37,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:53:37,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:53:37,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:53:37,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:53:37,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:53:37,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:53:37,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:53:37,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:53:37,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:53:37,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:53:37,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:53:37,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:53:37,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:53:37,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 02:53:37,626 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:53:37,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:53:37,627 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:53:37,627 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:53:37,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:53:37,628 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:53:37,629 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:53:37,629 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:53:37,629 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:53:37,629 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:53:37,630 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:53:37,631 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:53:37,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:53:37,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:53:37,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:53:37,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:53:37,633 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:53:37,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:53:37,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:53:37,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:53:37,634 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:53:37,634 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:53:37,634 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 02:53:37,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:53:37,635 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:53:37,635 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:53:37,635 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:53:37,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:53:37,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:53:37,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:53:37,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:53:37,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:53:37,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:53:37,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:53:37,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:53:37,638 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:53:37,638 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:53:37,638 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:53:37,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:53:37,639 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/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_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 [2022-11-03 02:53:38,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:53:38,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:53:38,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:53:38,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:53:38,109 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:53:38,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2022-11-03 02:53:38,191 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data/09067c88b/b2a5352385ac424b84c3543c10912074/FLAG867230bbb [2022-11-03 02:53:38,891 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:53:38,892 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2022-11-03 02:53:38,913 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data/09067c88b/b2a5352385ac424b84c3543c10912074/FLAG867230bbb [2022-11-03 02:53:39,088 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/data/09067c88b/b2a5352385ac424b84c3543c10912074 [2022-11-03 02:53:39,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:53:39,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:53:39,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:53:39,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:53:39,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:53:39,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:53:39" (1/1) ... [2022-11-03 02:53:39,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca2d353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:39, skipping insertion in model container [2022-11-03 02:53:39,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:53:39" (1/1) ... [2022-11-03 02:53:39,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:53:39,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:53:39,587 WARN L230 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_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[33021,33034] [2022-11-03 02:53:39,725 WARN L230 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_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[49681,49694] [2022-11-03 02:53:39,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:53:39,761 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 02:53:39,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:53:39,833 WARN L230 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_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[33021,33034] [2022-11-03 02:53:39,980 WARN L230 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_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[49681,49694] [2022-11-03 02:53:39,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:53:40,000 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:53:40,023 WARN L230 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_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[33021,33034] [2022-11-03 02:53:40,088 WARN L230 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_10a0f0b6-8053-4bcc-ae61-fb118816a621/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i[49681,49694] [2022-11-03 02:53:40,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:53:40,136 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:53:40,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40 WrapperNode [2022-11-03 02:53:40,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:53:40,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:53:40,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:53:40,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:53:40,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,330 INFO L138 Inliner]: procedures = 180, calls = 487, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1721 [2022-11-03 02:53:40,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:53:40,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:53:40,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:53:40,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:53:40,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,499 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:53:40,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:53:40,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:53:40,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:53:40,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (1/1) ... [2022-11-03 02:53:40,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:53:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:53:40,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:53:40,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:53:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-03 02:53:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:53:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 02:53:40,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 02:53:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-03 02:53:40,636 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-03 02:53:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:53:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:53:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:53:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:53:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-03 02:53:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:53:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:53:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:53:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:53:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:53:40,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:53:41,016 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:53:41,018 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:53:41,022 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 02:53:48,989 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:53:49,014 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:53:49,015 INFO L300 CfgBuilder]: Removed 100 assume(true) statements. [2022-11-03 02:53:49,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:53:49 BoogieIcfgContainer [2022-11-03 02:53:49,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:53:49,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:53:49,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:53:49,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:53:49,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:53:39" (1/3) ... [2022-11-03 02:53:49,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303c027b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:53:49, skipping insertion in model container [2022-11-03 02:53:49,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:53:40" (2/3) ... [2022-11-03 02:53:49,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303c027b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:53:49, skipping insertion in model container [2022-11-03 02:53:49,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:53:49" (3/3) ... [2022-11-03 02:53:49,035 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-3.i [2022-11-03 02:53:49,053 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:53:49,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 932 error locations. [2022-11-03 02:53:49,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:53:49,150 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72f8e4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:53:49,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 932 error locations. [2022-11-03 02:53:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 1833 states, 893 states have (on average 2.2642777155655094) internal successors, (2022), 1824 states have internal predecessors, (2022), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:53:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:53:49,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:49,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:53:49,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:53:49,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-03 02:53:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:53:49,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975331066] [2022-11-03 02:53:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:49,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:53:49,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:53:49,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:53:49,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:53:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:49,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 02:53:49,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:49,421 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-03 02:53:49,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:53:49,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:53:49,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975331066] [2022-11-03 02:53:49,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975331066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:49,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:49,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:53:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31795241] [2022-11-03 02:53:49,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:49,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:53:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:53:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:53:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:53:49,462 INFO L87 Difference]: Start difference. First operand has 1833 states, 893 states have (on average 2.2642777155655094) internal successors, (2022), 1824 states have internal predecessors, (2022), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) 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-03 02:53:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:49,574 INFO L93 Difference]: Finished difference Result 1815 states and 1917 transitions. [2022-11-03 02:53:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:53:49,576 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-03 02:53:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:49,599 INFO L225 Difference]: With dead ends: 1815 [2022-11-03 02:53:49,599 INFO L226 Difference]: Without dead ends: 1813 [2022-11-03 02:53:49,601 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-03 02:53:49,604 INFO L413 NwaCegarLoop]: 1917 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, 1917 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-03 02:53:49,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:53:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-11-03 02:53:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1813. [2022-11-03 02:53:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 884 states have (on average 2.1414027149321266) internal successors, (1893), 1804 states have internal predecessors, (1893), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:53:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 1915 transitions. [2022-11-03 02:53:49,712 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 1915 transitions. Word has length 5 [2022-11-03 02:53:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:49,712 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 1915 transitions. [2022-11-03 02:53:49,713 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-03 02:53:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 1915 transitions. [2022-11-03 02:53:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:53:49,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:49,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:53:49,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:53:49,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:53:49,926 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:53:49,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-03 02:53:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:53:49,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881857820] [2022-11-03 02:53:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:49,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:53:49,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:53:49,929 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:53:49,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:53:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:50,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:53:50,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:50,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:53:50,176 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-03 02:53:50,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:53:50,177 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:53:50,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881857820] [2022-11-03 02:53:50,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881857820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:50,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:50,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:53:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307384347] [2022-11-03 02:53:50,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:50,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:53:50,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:53:50,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:53:50,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:53:50,181 INFO L87 Difference]: Start difference. First operand 1813 states and 1915 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-03 02:53:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:53,892 INFO L93 Difference]: Finished difference Result 2069 states and 2214 transitions. [2022-11-03 02:53:53,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:53:53,893 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-03 02:53:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:53,908 INFO L225 Difference]: With dead ends: 2069 [2022-11-03 02:53:53,909 INFO L226 Difference]: Without dead ends: 2069 [2022-11-03 02:53:53,909 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-03 02:53:53,910 INFO L413 NwaCegarLoop]: 1354 mSDtfsCounter, 1369 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:53,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1809 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-03 02:53:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2022-11-03 02:53:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1798. [2022-11-03 02:53:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 960 states have (on average 2.017708333333333) internal successors, (1937), 1789 states have internal predecessors, (1937), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:53:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 1959 transitions. [2022-11-03 02:53:54,006 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 1959 transitions. Word has length 5 [2022-11-03 02:53:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:54,007 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 1959 transitions. [2022-11-03 02:53:54,007 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-03 02:53:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 1959 transitions. [2022-11-03 02:53:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:53:54,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:54,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:53:54,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-03 02:53:54,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:53:54,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:53:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-03 02:53:54,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:53:54,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263550202] [2022-11-03 02:53:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:54,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:53:54,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:53:54,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:53:54,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:53:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:54,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:53:54,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:54,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:53:54,449 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-03 02:53:54,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:53:54,449 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:53:54,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263550202] [2022-11-03 02:53:54,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263550202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:54,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:54,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:53:54,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172850340] [2022-11-03 02:53:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:54,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:53:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:53:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:53:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:53:54,455 INFO L87 Difference]: Start difference. First operand 1798 states and 1959 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-03 02:53:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:59,708 INFO L93 Difference]: Finished difference Result 2318 states and 2529 transitions. [2022-11-03 02:53:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:53:59,713 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-03 02:53:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:59,722 INFO L225 Difference]: With dead ends: 2318 [2022-11-03 02:53:59,722 INFO L226 Difference]: Without dead ends: 2318 [2022-11-03 02:53:59,722 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-03 02:53:59,723 INFO L413 NwaCegarLoop]: 1746 mSDtfsCounter, 741 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:59,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2548 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-11-03 02:53:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-11-03 02:53:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1954. [2022-11-03 02:53:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1126 states have (on average 1.992007104795737) internal successors, (2243), 1945 states have internal predecessors, (2243), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:53:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2265 transitions. [2022-11-03 02:53:59,806 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2265 transitions. Word has length 5 [2022-11-03 02:53:59,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:59,807 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2265 transitions. [2022-11-03 02:53:59,807 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-03 02:53:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2265 transitions. [2022-11-03 02:53:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:53:59,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:59,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:53:59,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:00,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:00,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-11-03 02:54:00,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:00,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993324010] [2022-11-03 02:54:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:00,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:00,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:00,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:00,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:54:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:00,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:54:00,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:00,216 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-03 02:54:00,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:00,218 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:00,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993324010] [2022-11-03 02:54:00,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993324010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:00,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:00,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:54:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745957011] [2022-11-03 02:54:00,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:00,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:54:00,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:00,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:54:00,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:54:00,226 INFO L87 Difference]: Start difference. First operand 1954 states and 2265 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-03 02:54:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:00,376 INFO L93 Difference]: Finished difference Result 3514 states and 4117 transitions. [2022-11-03 02:54:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:54:00,381 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-03 02:54:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:00,395 INFO L225 Difference]: With dead ends: 3514 [2022-11-03 02:54:00,398 INFO L226 Difference]: Without dead ends: 3514 [2022-11-03 02:54:00,398 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-03 02:54:00,400 INFO L413 NwaCegarLoop]: 2266 mSDtfsCounter, 1377 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 4069 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:00,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 4069 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:54:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2022-11-03 02:54:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 1956. [2022-11-03 02:54:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1128 states have (on average 1.9902482269503545) internal successors, (2245), 1947 states have internal predecessors, (2245), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2267 transitions. [2022-11-03 02:54:00,464 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2267 transitions. Word has length 6 [2022-11-03 02:54:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:00,470 INFO L495 AbstractCegarLoop]: Abstraction has 1956 states and 2267 transitions. [2022-11-03 02:54:00,471 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-03 02:54:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2267 transitions. [2022-11-03 02:54:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:54:00,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:00,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:00,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:00,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:00,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:00,684 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-03 02:54:00,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:00,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227807318] [2022-11-03 02:54:00,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:00,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:00,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:00,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:00,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 02:54:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:00,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:54:00,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:00,901 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-03 02:54:00,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:00,902 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:00,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227807318] [2022-11-03 02:54:00,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227807318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:00,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:00,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:54:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239382617] [2022-11-03 02:54:00,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:00,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:54:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:54:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:54:00,904 INFO L87 Difference]: Start difference. First operand 1956 states and 2267 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-03 02:54:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:00,949 INFO L93 Difference]: Finished difference Result 1920 states and 2230 transitions. [2022-11-03 02:54:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:54:00,950 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-03 02:54:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:00,957 INFO L225 Difference]: With dead ends: 1920 [2022-11-03 02:54:00,957 INFO L226 Difference]: Without dead ends: 1920 [2022-11-03 02:54:00,957 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-03 02:54:00,958 INFO L413 NwaCegarLoop]: 1766 mSDtfsCounter, 1736 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 1794 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-03 02:54:00,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 1794 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:54:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2022-11-03 02:54:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1914. [2022-11-03 02:54:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1110 states have (on average 1.9837837837837837) internal successors, (2202), 1905 states have internal predecessors, (2202), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2224 transitions. [2022-11-03 02:54:00,997 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2224 transitions. Word has length 11 [2022-11-03 02:54:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:00,997 INFO L495 AbstractCegarLoop]: Abstraction has 1914 states and 2224 transitions. [2022-11-03 02:54:00,997 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-03 02:54:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2224 transitions. [2022-11-03 02:54:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:54:00,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:00,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:54:01,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:01,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:01,211 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-03 02:54:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:01,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193955277] [2022-11-03 02:54:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:01,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:01,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:01,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:01,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:54:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:01,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:54:01,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:01,462 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-03 02:54:01,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:01,462 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:01,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193955277] [2022-11-03 02:54:01,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193955277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:01,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:01,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:54:01,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331505651] [2022-11-03 02:54:01,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:01,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:54:01,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:01,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:54:01,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:54:01,464 INFO L87 Difference]: Start difference. First operand 1914 states and 2224 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-03 02:54:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:01,574 INFO L93 Difference]: Finished difference Result 1899 states and 2202 transitions. [2022-11-03 02:54:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:54:01,575 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-03 02:54:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:01,582 INFO L225 Difference]: With dead ends: 1899 [2022-11-03 02:54:01,582 INFO L226 Difference]: Without dead ends: 1899 [2022-11-03 02:54:01,583 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-03 02:54:01,584 INFO L413 NwaCegarLoop]: 1721 mSDtfsCounter, 1707 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:01,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 3463 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:54:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-11-03 02:54:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1892. [2022-11-03 02:54:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1102 states have (on average 1.971869328493648) internal successors, (2173), 1883 states have internal predecessors, (2173), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2195 transitions. [2022-11-03 02:54:01,624 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2195 transitions. Word has length 13 [2022-11-03 02:54:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:01,624 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2195 transitions. [2022-11-03 02:54:01,625 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-03 02:54:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2195 transitions. [2022-11-03 02:54:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:54:01,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:01,626 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-03 02:54:01,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:01,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:01,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-03 02:54:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:01,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803579297] [2022-11-03 02:54:01,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:01,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:01,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:01,846 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:01,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 02:54:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:02,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:54:02,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:02,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:54:02,171 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-03 02:54:02,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:02,171 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:02,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803579297] [2022-11-03 02:54:02,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803579297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:02,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:02,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:54:02,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246647759] [2022-11-03 02:54:02,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:02,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:54:02,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:02,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:54:02,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:54:02,174 INFO L87 Difference]: Start difference. First operand 1892 states and 2195 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-03 02:54:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:07,985 INFO L93 Difference]: Finished difference Result 3106 states and 3455 transitions. [2022-11-03 02:54:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:54:07,986 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-03 02:54:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:07,996 INFO L225 Difference]: With dead ends: 3106 [2022-11-03 02:54:07,997 INFO L226 Difference]: Without dead ends: 3106 [2022-11-03 02:54:07,997 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-03 02:54:07,998 INFO L413 NwaCegarLoop]: 1071 mSDtfsCounter, 3382 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3390 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:07,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3390 Valid, 2422 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-03 02:54:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-11-03 02:54:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1888. [2022-11-03 02:54:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1102 states have (on average 1.9682395644283122) internal successors, (2169), 1879 states have internal predecessors, (2169), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2191 transitions. [2022-11-03 02:54:08,051 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2191 transitions. Word has length 27 [2022-11-03 02:54:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:08,052 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2191 transitions. [2022-11-03 02:54:08,052 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-03 02:54:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2191 transitions. [2022-11-03 02:54:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:54:08,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:08,053 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-03 02:54:08,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:08,265 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-03 02:54:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:08,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645199282] [2022-11-03 02:54:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:08,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:08,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:08,269 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:08,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 02:54:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:08,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:54:08,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:08,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:54:08,798 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-03 02:54:08,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:08,798 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:08,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645199282] [2022-11-03 02:54:08,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645199282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:08,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:08,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:54:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358867531] [2022-11-03 02:54:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:08,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:54:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:08,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:54:08,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:54:08,800 INFO L87 Difference]: Start difference. First operand 1888 states and 2191 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-03 02:54:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:16,197 INFO L93 Difference]: Finished difference Result 2634 states and 2855 transitions. [2022-11-03 02:54:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:54:16,197 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-03 02:54:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:16,205 INFO L225 Difference]: With dead ends: 2634 [2022-11-03 02:54:16,205 INFO L226 Difference]: Without dead ends: 2634 [2022-11-03 02:54:16,205 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-03 02:54:16,206 INFO L413 NwaCegarLoop]: 1272 mSDtfsCounter, 1687 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:16,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 2885 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-03 02:54:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-11-03 02:54:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1884. [2022-11-03 02:54:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1102 states have (on average 1.9646098003629764) internal successors, (2165), 1875 states have internal predecessors, (2165), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2187 transitions. [2022-11-03 02:54:16,246 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2187 transitions. Word has length 27 [2022-11-03 02:54:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:16,246 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 2187 transitions. [2022-11-03 02:54:16,247 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-03 02:54:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2187 transitions. [2022-11-03 02:54:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:54:16,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:16,248 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-03 02:54:16,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-03 02:54:16,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:16,460 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-03 02:54:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:16,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120037864] [2022-11-03 02:54:16,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:16,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:16,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:16,463 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:16,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:54:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:16,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:54:16,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:16,810 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-03 02:54:16,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:16,810 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120037864] [2022-11-03 02:54:16,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120037864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:16,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:16,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:54:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948853158] [2022-11-03 02:54:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:16,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:54:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:54:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:54:16,813 INFO L87 Difference]: Start difference. First operand 1884 states and 2187 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-03 02:54:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:16,889 INFO L93 Difference]: Finished difference Result 1884 states and 2183 transitions. [2022-11-03 02:54:16,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:54:16,889 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-03 02:54:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:16,895 INFO L225 Difference]: With dead ends: 1884 [2022-11-03 02:54:16,896 INFO L226 Difference]: Without dead ends: 1884 [2022-11-03 02:54:16,896 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-03 02:54:16,898 INFO L413 NwaCegarLoop]: 1715 mSDtfsCounter, 1683 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:16,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 3441 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:54:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-11-03 02:54:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1878. [2022-11-03 02:54:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1096 states have (on average 1.9662408759124088) internal successors, (2155), 1869 states have internal predecessors, (2155), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2177 transitions. [2022-11-03 02:54:16,947 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2177 transitions. Word has length 42 [2022-11-03 02:54:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:16,948 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2177 transitions. [2022-11-03 02:54:16,949 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-03 02:54:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2177 transitions. [2022-11-03 02:54:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 02:54:16,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:16,953 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-03 02:54:16,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:17,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:17,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-03 02:54:17,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:17,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686136719] [2022-11-03 02:54:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:17,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:17,170 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:17,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 02:54:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:17,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:54:17,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:17,727 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-03 02:54:17,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:17,728 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:17,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686136719] [2022-11-03 02:54:17,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686136719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:17,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:17,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:54:17,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855345286] [2022-11-03 02:54:17,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:17,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:54:17,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:17,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:54:17,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:54:17,729 INFO L87 Difference]: Start difference. First operand 1878 states and 2177 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-03 02:54:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:17,999 INFO L93 Difference]: Finished difference Result 2297 states and 2613 transitions. [2022-11-03 02:54:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:54:18,000 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-03 02:54:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:18,007 INFO L225 Difference]: With dead ends: 2297 [2022-11-03 02:54:18,007 INFO L226 Difference]: Without dead ends: 2297 [2022-11-03 02:54:18,007 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-03 02:54:18,008 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 455 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:18,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3382 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:54:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2022-11-03 02:54:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1924. [2022-11-03 02:54:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1142 states have (on average 1.9273204903677759) internal successors, (2201), 1915 states have internal predecessors, (2201), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2223 transitions. [2022-11-03 02:54:18,041 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2223 transitions. Word has length 50 [2022-11-03 02:54:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:18,042 INFO L495 AbstractCegarLoop]: Abstraction has 1924 states and 2223 transitions. [2022-11-03 02:54:18,042 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-03 02:54:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2223 transitions. [2022-11-03 02:54:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-03 02:54:18,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:18,043 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-03 02:54:18,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:18,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:18,257 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-03 02:54:18,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:18,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688323485] [2022-11-03 02:54:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:18,260 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:18,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 02:54:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:18,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:54:18,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:18,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:54:18,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:54:19,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:54:19,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:54:19,264 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:54:19,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 02:54:19,288 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-03 02:54:19,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:19,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:19,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688323485] [2022-11-03 02:54:19,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688323485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:19,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:19,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:54:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831081317] [2022-11-03 02:54:19,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:19,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:54:19,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:54:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:54:19,291 INFO L87 Difference]: Start difference. First operand 1924 states and 2223 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-03 02:54:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:24,262 INFO L93 Difference]: Finished difference Result 2111 states and 2394 transitions. [2022-11-03 02:54:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:54:24,263 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-03 02:54:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:24,269 INFO L225 Difference]: With dead ends: 2111 [2022-11-03 02:54:24,269 INFO L226 Difference]: Without dead ends: 2111 [2022-11-03 02:54:24,270 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-03 02:54:24,270 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 1569 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:24,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1308 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-03 02:54:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2022-11-03 02:54:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1674. [2022-11-03 02:54:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 976 states have (on average 1.8442622950819672) internal successors, (1800), 1665 states have internal predecessors, (1800), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 1822 transitions. [2022-11-03 02:54:24,298 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 1822 transitions. Word has length 53 [2022-11-03 02:54:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:24,299 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 1822 transitions. [2022-11-03 02:54:24,299 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-03 02:54:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1822 transitions. [2022-11-03 02:54:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 02:54:24,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:24,300 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-03 02:54:24,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:24,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:24,516 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:24,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-03 02:54:24,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:24,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287177829] [2022-11-03 02:54:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:24,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:24,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:24,519 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:24,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 02:54:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:24,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:54:24,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:24,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:54:24,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:54:24,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 02:54:24,910 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-03 02:54:24,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:24,911 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:24,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287177829] [2022-11-03 02:54:24,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287177829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:24,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:24,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:54:24,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278741461] [2022-11-03 02:54:24,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:24,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:54:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:24,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:54:24,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:54:24,913 INFO L87 Difference]: Start difference. First operand 1674 states and 1822 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-03 02:54:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:29,704 INFO L93 Difference]: Finished difference Result 1673 states and 1821 transitions. [2022-11-03 02:54:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:54:29,705 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-03 02:54:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:29,709 INFO L225 Difference]: With dead ends: 1673 [2022-11-03 02:54:29,709 INFO L226 Difference]: Without dead ends: 1673 [2022-11-03 02:54:29,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:54:29,710 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:29,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4160 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-03 02:54:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-11-03 02:54:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2022-11-03 02:54:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 976 states have (on average 1.8432377049180328) internal successors, (1799), 1664 states have internal predecessors, (1799), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1821 transitions. [2022-11-03 02:54:29,735 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1821 transitions. Word has length 58 [2022-11-03 02:54:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:29,736 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 1821 transitions. [2022-11-03 02:54:29,736 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-03 02:54:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1821 transitions. [2022-11-03 02:54:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 02:54:29,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:29,737 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-03 02:54:29,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-03 02:54:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:29,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-03 02:54:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:29,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873567699] [2022-11-03 02:54:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:29,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:29,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:29,955 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:29,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 02:54:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:30,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:54:30,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:30,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:54:30,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:54:30,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:54:30,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-03 02:54:30,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:54:30,433 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-03 02:54:30,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:30,433 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:30,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873567699] [2022-11-03 02:54:30,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873567699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:30,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:30,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:54:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456543856] [2022-11-03 02:54:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:30,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:54:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:30,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:54:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:54:30,435 INFO L87 Difference]: Start difference. First operand 1673 states and 1821 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-03 02:54:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:36,938 INFO L93 Difference]: Finished difference Result 1672 states and 1820 transitions. [2022-11-03 02:54:36,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:54:36,939 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-03 02:54:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:36,943 INFO L225 Difference]: With dead ends: 1672 [2022-11-03 02:54:36,943 INFO L226 Difference]: Without dead ends: 1672 [2022-11-03 02:54:36,944 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-03 02:54:36,944 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 2 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4218 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:36,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4218 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-11-03 02:54:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2022-11-03 02:54:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2022-11-03 02:54:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 975 states have (on average 1.8441025641025641) internal successors, (1798), 1663 states have internal predecessors, (1798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-03 02:54:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1820 transitions. [2022-11-03 02:54:36,969 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1820 transitions. Word has length 58 [2022-11-03 02:54:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:36,970 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1820 transitions. [2022-11-03 02:54:36,970 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-03 02:54:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1820 transitions. [2022-11-03 02:54:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-03 02:54:36,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:36,971 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-03 02:54:36,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-11-03 02:54:37,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:37,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1810601854, now seen corresponding path program 1 times [2022-11-03 02:54:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:37,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477338382] [2022-11-03 02:54:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:37,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:37,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:37,189 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:37,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-03 02:54:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:37,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:54:37,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:37,594 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-03 02:54:37,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:54:37,595 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477338382] [2022-11-03 02:54:37,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477338382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:54:37,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:54:37,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:54:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447740304] [2022-11-03 02:54:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:54:37,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:54:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:37,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:54:37,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:54:37,597 INFO L87 Difference]: Start difference. First operand 1672 states and 1820 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-03 02:54:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:37,673 INFO L93 Difference]: Finished difference Result 1675 states and 1825 transitions. [2022-11-03 02:54:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:54:37,673 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-03 02:54:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:37,687 INFO L225 Difference]: With dead ends: 1675 [2022-11-03 02:54:37,691 INFO L226 Difference]: Without dead ends: 1675 [2022-11-03 02:54:37,695 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-03 02:54:37,695 INFO L413 NwaCegarLoop]: 1634 mSDtfsCounter, 2 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4894 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-03 02:54:37,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4894 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:54:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-11-03 02:54:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2022-11-03 02:54:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 977 states have (on average 1.8433981576253837) internal successors, (1801), 1666 states have internal predecessors, (1801), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 02:54:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 1825 transitions. [2022-11-03 02:54:37,725 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 1825 transitions. Word has length 66 [2022-11-03 02:54:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:37,725 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 1825 transitions. [2022-11-03 02:54:37,726 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-03 02:54:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1825 transitions. [2022-11-03 02:54:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 02:54:37,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:37,726 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-03 02:54:37,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:37,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:54:37,941 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash 279721407, now seen corresponding path program 1 times [2022-11-03 02:54:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:37,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145502488] [2022-11-03 02:54:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:37,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:37,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:37,944 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:37,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 02:54:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:38,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:54:38,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:38,385 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-03 02:54:38,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:38,494 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-03 02:54:38,494 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:38,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145502488] [2022-11-03 02:54:38,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145502488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:38,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [793842294] [2022-11-03 02:54:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:38,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:54:38,498 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:54:38,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-03 02:54:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:39,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:54:39,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:39,131 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-03 02:54:39,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:39,182 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-03 02:54:39,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [793842294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:39,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900403136] [2022-11-03 02:54:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:54:39,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:39,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:54:39,184 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:54:39,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:54:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:54:39,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:54:39,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:39,545 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-03 02:54:39,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:39,594 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-03 02:54:39,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900403136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:39,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:54:39,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-03 02:54:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61614196] [2022-11-03 02:54:39,595 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:54:39,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:54:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:54:39,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:54:39,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:54:39,597 INFO L87 Difference]: Start difference. First operand 1675 states and 1825 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-03 02:54:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:54:39,857 INFO L93 Difference]: Finished difference Result 1687 states and 1843 transitions. [2022-11-03 02:54:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:54:39,858 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-03 02:54:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:54:39,861 INFO L225 Difference]: With dead ends: 1687 [2022-11-03 02:54:39,861 INFO L226 Difference]: Without dead ends: 1687 [2022-11-03 02:54:39,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 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-03 02:54:39,862 INFO L413 NwaCegarLoop]: 1634 mSDtfsCounter, 15 mSDsluCounter, 8137 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9771 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:54:39,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9771 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:54:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2022-11-03 02:54:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1685. [2022-11-03 02:54:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 986 states have (on average 1.841784989858012) internal successors, (1816), 1675 states have internal predecessors, (1816), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 02:54:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1840 transitions. [2022-11-03 02:54:39,890 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1840 transitions. Word has length 67 [2022-11-03 02:54:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:54:39,890 INFO L495 AbstractCegarLoop]: Abstraction has 1685 states and 1840 transitions. [2022-11-03 02:54:39,891 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-03 02:54:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1840 transitions. [2022-11-03 02:54:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-03 02:54:39,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:54:39,892 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-03 02:54:39,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:40,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:40,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:54:40,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:40,506 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:54:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:54:40,506 INFO L85 PathProgramCache]: Analyzing trace with hash -431906882, now seen corresponding path program 2 times [2022-11-03 02:54:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:54:40,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319874242] [2022-11-03 02:54:40,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:54:40,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:54:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:54:40,509 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:54:40,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 02:54:41,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:54:41,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:54:41,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:54:41,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:41,153 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-03 02:54:41,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:41,399 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-03 02:54:41,399 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:54:41,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319874242] [2022-11-03 02:54:41,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319874242] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:41,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [927023382] [2022-11-03 02:54:41,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:54:41,400 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:54:41,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:54:41,405 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:54:41,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-03 02:54:42,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:54:42,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:54:42,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:54:42,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:54:42,957 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-03 02:54:42,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:54:43,044 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-03 02:54:43,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [927023382] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:54:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64206220] [2022-11-03 02:54:43,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:54:43,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:54:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:54:43,047 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:54:43,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 02:55:01,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:55:01,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:55:01,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 02:55:01,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:55:01,822 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:55:01,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 02:55:01,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:55:02,366 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:55:02,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 02:55:02,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 02:55:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:55:02,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:55:02,684 INFO L356 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-03 02:55:02,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:55:02,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1301) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-11-03 02:55:02,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64206220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:55:02,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 02:55:02,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-03 02:55:02,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700826966] [2022-11-03 02:55:02,698 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 02:55:02,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 02:55:02,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:55:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 02:55:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-03 02:55:02,699 INFO L87 Difference]: Start difference. First operand 1685 states and 1840 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:55:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:55:31,052 INFO L93 Difference]: Finished difference Result 3337 states and 3618 transitions. [2022-11-03 02:55:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 02:55:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-11-03 02:55:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:55:31,060 INFO L225 Difference]: With dead ends: 3337 [2022-11-03 02:55:31,061 INFO L226 Difference]: Without dead ends: 3337 [2022-11-03 02:55:31,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=318, Invalid=1916, Unknown=26, NotChecked=92, Total=2352 [2022-11-03 02:55:31,062 INFO L413 NwaCegarLoop]: 1618 mSDtfsCounter, 2627 mSDsluCounter, 19545 mSDsCounter, 0 mSdLazyCounter, 15222 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 21163 SdHoareTripleChecker+Invalid, 16648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 15222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1352 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:55:31,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2639 Valid, 21163 Invalid, 16648 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 15222 Invalid, 0 Unknown, 1352 Unchecked, 27.0s Time] [2022-11-03 02:55:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2022-11-03 02:55:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 1691. [2022-11-03 02:55:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 992 states have (on average 1.840725806451613) internal successors, (1826), 1681 states have internal predecessors, (1826), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-03 02:55:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 1851 transitions. [2022-11-03 02:55:31,100 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 1851 transitions. Word has length 70 [2022-11-03 02:55:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:55:31,101 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 1851 transitions. [2022-11-03 02:55:31,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:55:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 1851 transitions. [2022-11-03 02:55:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-03 02:55:31,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:55:31,102 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:31,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:55:31,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 02:55:31,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-03 02:55:31,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:55:31,710 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:55:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:55:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2139335360, now seen corresponding path program 1 times [2022-11-03 02:55:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:55:31,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018866067] [2022-11-03 02:55:31,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:55:31,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:55:31,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:55:31,712 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:55:31,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 02:55:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:55:32,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:55:32,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:55:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:32,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:55:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:32,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:55:32,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018866067] [2022-11-03 02:55:32,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018866067] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:55:32,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1992690645] [2022-11-03 02:55:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:55:32,896 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:55:32,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:55:32,897 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:55:32,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-03 02:55:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:55:33,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:55:33,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:55:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:33,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:55:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:33,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1992690645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:55:33,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631268574] [2022-11-03 02:55:33,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:55:33,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:55:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:55:33,853 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:55:33,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 02:55:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:55:34,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 02:55:34,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:55:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:34,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:55:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:35,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631268574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:55:35,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:55:35,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2022-11-03 02:55:35,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310863387] [2022-11-03 02:55:35,243 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:55:35,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:55:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:55:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:55:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 02:55:35,246 INFO L87 Difference]: Start difference. First operand 1691 states and 1851 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:55:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:55:39,269 INFO L93 Difference]: Finished difference Result 1740 states and 1919 transitions. [2022-11-03 02:55:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-03 02:55:39,270 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 75 [2022-11-03 02:55:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:55:39,275 INFO L225 Difference]: With dead ends: 1740 [2022-11-03 02:55:39,275 INFO L226 Difference]: Without dead ends: 1724 [2022-11-03 02:55:39,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2022-11-03 02:55:39,277 INFO L413 NwaCegarLoop]: 1639 mSDtfsCounter, 230 mSDsluCounter, 24467 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 26106 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:55:39,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 26106 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 02:55:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2022-11-03 02:55:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1708. [2022-11-03 02:55:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1010 states have (on average 1.8277227722772278) internal successors, (1846), 1698 states have internal predecessors, (1846), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 02:55:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 1870 transitions. [2022-11-03 02:55:39,306 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 1870 transitions. Word has length 75 [2022-11-03 02:55:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:55:39,306 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 1870 transitions. [2022-11-03 02:55:39,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 02:55:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 1870 transitions. [2022-11-03 02:55:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-03 02:55:39,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:55:39,308 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:39,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 02:55:39,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-03 02:55:39,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2022-11-03 02:55:39,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:55:39,921 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:55:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:55:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1664319297, now seen corresponding path program 2 times [2022-11-03 02:55:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:55:39,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046401023] [2022-11-03 02:55:39,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:55:39,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:55:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:55:39,924 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:55:39,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-03 02:55:40,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:55:40,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:55:40,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 02:55:40,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:55:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:41,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:55:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:44,708 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:55:44,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046401023] [2022-11-03 02:55:44,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046401023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:55:44,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2084663842] [2022-11-03 02:55:44,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:55:44,709 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:55:44,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:55:44,713 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:55:44,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-03 02:55:46,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:55:46,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:55:46,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 02:55:46,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:55:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:46,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:55:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:55:47,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2084663842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:55:47,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892415541] [2022-11-03 02:55:47,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:55:47,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:55:47,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:55:47,945 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:55:47,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 02:56:07,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:56:07,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:56:07,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:56:07,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:56:07,824 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:56:07,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 02:56:07,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:56:07,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:56:07,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:56:08,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 02:56:08,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 02:56:08,636 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2369) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2370)))) is different from true [2022-11-03 02:56:08,836 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2374))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-11-03 02:56:08,861 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376)))) is different from true [2022-11-03 02:56:09,043 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 02:56:09,557 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 02:56:09,570 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389)))) is different from true [2022-11-03 02:56:09,587 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-11-03 02:56:09,601 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394)))) is different from true [2022-11-03 02:56:09,768 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2397))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2398)))) is different from true [2022-11-03 02:56:09,973 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401)))) is different from true [2022-11-03 02:56:09,987 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 02:56:10,001 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406)))) is different from true [2022-11-03 02:56:10,213 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:56:10,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 02:56:10,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:56:10,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 02:56:10,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:56:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 174 not checked. [2022-11-03 02:56:10,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:56:11,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2451) |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_2452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2451) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-03 02:56:11,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892415541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:56:11,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 02:56:11,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 21] total 66 [2022-11-03 02:56:11,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076626136] [2022-11-03 02:56:11,511 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 02:56:11,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-03 02:56:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:56:11,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-03 02:56:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=2473, Unknown=36, NotChecked=1560, Total=4692 [2022-11-03 02:56:11,515 INFO L87 Difference]: Start difference. First operand 1708 states and 1870 transitions. Second operand has 66 states, 65 states have (on average 2.8) internal successors, (182), 66 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:56:40,646 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2388))) (exists ((v_ArrVal_2374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2374))) (exists ((v_ArrVal_2390 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2390))) (exists ((v_ArrVal_2393 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2393))) (exists ((v_ArrVal_2392 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2392))) (exists ((v_ArrVal_2404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2404))) (exists ((v_ArrVal_2391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2391))) (exists ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2402))) (exists ((v_ArrVal_2397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2397))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2405))) (exists ((v_ArrVal_2398 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2398))) (exists ((v_ArrVal_2406 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2406))) (exists ((v_ArrVal_2389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2389))) (exists ((v_ArrVal_2371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2371))) (exists ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2401))) (exists ((v_ArrVal_2375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2376 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2376))) (exists ((v_ArrVal_2387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2372))) (exists ((v_ArrVal_2373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2373)))) is different from true [2022-11-03 02:58:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:58:26,919 INFO L93 Difference]: Finished difference Result 3471 states and 3868 transitions. [2022-11-03 02:58:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-03 02:58:26,920 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.8) internal successors, (182), 66 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2022-11-03 02:58:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:58:26,925 INFO L225 Difference]: With dead ends: 3471 [2022-11-03 02:58:26,926 INFO L226 Difference]: Without dead ends: 3457 [2022-11-03 02:58:26,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 350 SyntacticMatches, 15 SemanticMatches, 160 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 5772 ImplicationChecksByTransitivity, 60.0s TimeCoverageRelationStatistics Valid=4713, Invalid=16917, Unknown=182, NotChecked=4270, Total=26082 [2022-11-03 02:58:26,930 INFO L413 NwaCegarLoop]: 1637 mSDtfsCounter, 3097 mSDsluCounter, 41637 mSDsCounter, 0 mSdLazyCounter, 36800 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3170 SdHoareTripleChecker+Valid, 43274 SdHoareTripleChecker+Invalid, 68781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 36800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31732 IncrementalHoareTripleChecker+Unchecked, 80.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:58:26,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3170 Valid, 43274 Invalid, 68781 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [249 Valid, 36800 Invalid, 0 Unknown, 31732 Unchecked, 80.0s Time] [2022-11-03 02:58:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2022-11-03 02:58:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 1786. [2022-11-03 02:58:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1088 states have (on average 1.7766544117647058) internal successors, (1933), 1775 states have internal predecessors, (1933), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 02:58:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 1957 transitions. [2022-11-03 02:58:26,976 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 1957 transitions. Word has length 86 [2022-11-03 02:58:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:58:26,976 INFO L495 AbstractCegarLoop]: Abstraction has 1786 states and 1957 transitions. [2022-11-03 02:58:26,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.8) internal successors, (182), 66 states have internal predecessors, (182), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:58:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 1957 transitions. [2022-11-03 02:58:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-03 02:58:26,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:58:26,978 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:58:27,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-03 02:58:27,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-03 02:58:27,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 02:58:27,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:58:27,592 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 02:58:27,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:58:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1662654294, now seen corresponding path program 1 times [2022-11-03 02:58:27,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:58:27,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141578307] [2022-11-03 02:58:27,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:27,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:58:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:58:27,594 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:58:27,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-03 02:58:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:28,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 02:58:28,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:58:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:58:29,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:58:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:58:35,949 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:58:35,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141578307] [2022-11-03 02:58:35,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141578307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:58:35,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [452666209] [2022-11-03 02:58:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:35,950 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:58:35,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:58:35,951 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:58:35,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-03 02:58:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:37,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 02:58:37,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:58:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:58:37,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:58:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:58:38,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [452666209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:58:38,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629394151] [2022-11-03 02:58:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:38,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:58:38,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:58:38,498 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:58:38,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 02:58:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:39,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 02:58:39,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:58:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:58:39,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:58:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:58:50,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629394151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:58:50,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:58:50,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2022-11-03 02:58:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488465827] [2022-11-03 02:58:50,713 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:58:50,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-03 02:58:50,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:58:50,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-03 02:58:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2022-11-03 02:58:50,719 INFO L87 Difference]: Start difference. First operand 1786 states and 1957 transitions. Second operand has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:01:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:01:34,554 INFO L93 Difference]: Finished difference Result 1976 states and 2287 transitions. [2022-11-03 03:01:34,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-11-03 03:01:34,555 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 110 [2022-11-03 03:01:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:01:34,560 INFO L225 Difference]: With dead ends: 1976 [2022-11-03 03:01:34,560 INFO L226 Difference]: Without dead ends: 1968 [2022-11-03 03:01:34,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7405 ImplicationChecksByTransitivity, 156.5s TimeCoverageRelationStatistics Valid=18292, Invalid=46478, Unknown=0, NotChecked=0, Total=64770 [2022-11-03 03:01:34,569 INFO L413 NwaCegarLoop]: 1668 mSDtfsCounter, 1077 mSDsluCounter, 94180 mSDsCounter, 0 mSdLazyCounter, 10114 mSolverCounterSat, 1497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 95848 SdHoareTripleChecker+Invalid, 11611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1497 IncrementalHoareTripleChecker+Valid, 10114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:01:34,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 95848 Invalid, 11611 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1497 Valid, 10114 Invalid, 0 Unknown, 0 Unchecked, 22.4s Time] [2022-11-03 03:01:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2022-11-03 03:01:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1892. [2022-11-03 03:01:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1194 states have (on average 1.7261306532663316) internal successors, (2061), 1881 states have internal predecessors, (2061), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 03:01:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2085 transitions. [2022-11-03 03:01:34,606 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2085 transitions. Word has length 110 [2022-11-03 03:01:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:01:34,606 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2085 transitions. [2022-11-03 03:01:34,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:01:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2085 transitions. [2022-11-03 03:01:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-03 03:01:34,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:01:34,608 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-03 03:01:34,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-03 03:01:34,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 03:01:35,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-03 03:01:35,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 03:01:35,221 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:01:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:01:35,222 INFO L85 PathProgramCache]: Analyzing trace with hash -484834313, now seen corresponding path program 2 times [2022-11-03 03:01:35,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:01:35,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140925447] [2022-11-03 03:01:35,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 03:01:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:01:35,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:01:35,224 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:01:35,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-03 03:01:35,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-03 03:01:35,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:01:35,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 03:01:35,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:01:35,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:01:35,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:01:36,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:01:36,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 03:01:36,467 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:01:36,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 03:01:36,733 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-03 03:01:36,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2022-11-03 03:01:36,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:01:36,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-11-03 03:01:37,010 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 03:01:37,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-11-03 03:01:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-03 03:01:37,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:01:37,044 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:01:37,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140925447] [2022-11-03 03:01:37,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140925447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:01:37,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:01:37,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:01:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645660290] [2022-11-03 03:01:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:01:37,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:01:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:01:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:01:37,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:01:37,046 INFO L87 Difference]: Start difference. First operand 1892 states and 2085 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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-03 03:01:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:01:42,985 INFO L93 Difference]: Finished difference Result 2433 states and 2679 transitions. [2022-11-03 03:01:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:01:42,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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 113 [2022-11-03 03:01:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:01:42,991 INFO L225 Difference]: With dead ends: 2433 [2022-11-03 03:01:42,991 INFO L226 Difference]: Without dead ends: 2433 [2022-11-03 03:01:42,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:01:42,992 INFO L413 NwaCegarLoop]: 1819 mSDtfsCounter, 1933 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 5009 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1931 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:01:42,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 5009 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1955 Invalid, 0 Unknown, 1931 Unchecked, 5.9s Time] [2022-11-03 03:01:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2022-11-03 03:01:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 1891. [2022-11-03 03:01:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1194 states have (on average 1.7252931323283083) internal successors, (2060), 1880 states have internal predecessors, (2060), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 03:01:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2084 transitions. [2022-11-03 03:01:43,025 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2084 transitions. Word has length 113 [2022-11-03 03:01:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:01:43,026 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 2084 transitions. [2022-11-03 03:01:43,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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-03 03:01:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2084 transitions. [2022-11-03 03:01:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-03 03:01:43,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:01:43,028 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-03 03:01:43,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-11-03 03:01:43,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 03:01:43,247 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:01:43,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:01:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash -484834312, now seen corresponding path program 1 times [2022-11-03 03:01:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:01:43,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856089972] [2022-11-03 03:01:43,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:01:43,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:01:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:01:43,251 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:01:43,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-03 03:01:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:01:44,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-03 03:01:44,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:01:44,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:01:44,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:01:44,493 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:01:44,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 03:01:44,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:01:44,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:01:44,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:01:44,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:01:44,725 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,787 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,801 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,815 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,829 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,844 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224)))) is different from true [2022-11-03 03:01:44,859 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,874 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228)))) is different from true [2022-11-03 03:01:44,930 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232)))) is different from true [2022-11-03 03:01:44,946 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234))) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,962 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,978 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:44,994 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4239))) (exists ((v_ArrVal_4240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4240))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:45,055 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 03:01:45,151 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 03:01:45,166 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:45,181 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-11-03 03:01:45,196 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256)))) is different from true [2022-11-03 03:01:45,253 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260)))) is different from true [2022-11-03 03:01:45,269 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262)))) is different from true [2022-11-03 03:01:45,285 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:45,409 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:45,424 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:45,737 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:45,791 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:45,806 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:01:45,820 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298)))) is different from true [2022-11-03 03:01:45,866 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:01:45,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 03:01:45,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 03:01:46,004 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:01:46,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 03:01:46,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 03:01:46,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 03:01:46,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 03:01:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 837 not checked. [2022-11-03 03:01:46,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:01:46,283 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4300) |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_4299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-03 03:01:46,331 WARN L833 $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_4300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-03 03:01:47,289 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4300 (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_4391) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4392))) (let ((.cse2 (select (select .cse3 |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_4391) .cse2 v_ArrVal_4300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-03 03:01:47,303 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:01:47,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856089972] [2022-11-03 03:01:47,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856089972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:01:47,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1328725638] [2022-11-03 03:01:47,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:01:47,303 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:01:47,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:01:47,305 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:01:47,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-03 03:04:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:04:03,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-03 03:04:03,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:04:03,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:04:03,665 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:04:03,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 03:04:03,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:04:03,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:04:03,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:04:03,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:04:03,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:04:03,872 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760)))) is different from true [2022-11-03 03:04:03,936 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:03,953 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,016 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,033 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771)))) is different from true [2022-11-03 03:04:04,051 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774)))) is different from true [2022-11-03 03:04:04,068 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,215 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,236 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,346 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,463 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,482 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,541 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,561 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,623 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,725 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816)))) is different from true [2022-11-03 03:04:04,785 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,954 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4829))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,974 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:04,992 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:05,010 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4836))) (exists ((v_ArrVal_4835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4835) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:05,028 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4837))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4838)))) is different from true [2022-11-03 03:04:05,046 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4839))) (exists ((v_ArrVal_4840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4840))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:05,063 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4842))) (exists ((v_ArrVal_4841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4841))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:05,128 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4845))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:05,182 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:04:05,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 03:04:05,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 03:04:05,284 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:04:05,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 03:04:05,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 03:04:05,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 03:04:05,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 03:04:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 837 not checked. [2022-11-03 03:04:05,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:04:05,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4848 (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_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-03 03:04:05,486 WARN L833 $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_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4848 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-03 03:04:06,451 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4939))) (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_4940) .cse0 v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4939 (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_4940) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4939) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-03 03:04:06,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1328725638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:04:06,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199091590] [2022-11-03 03:04:06,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:04:06,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:04:06,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:04:06,463 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:04:06,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 03:04:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:04:07,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-03 03:04:07,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:04:07,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:04:07,437 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 03:04:07,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 03:04:07,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:04:07,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:04:07,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:04:07,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:04:07,679 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-11-03 03:04:07,743 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:07,901 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:07,919 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:07,936 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322)))) is different from true [2022-11-03 03:04:08,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,065 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,082 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,100 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335))) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,384 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,404 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,420 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 03:04:08,436 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,451 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357))) (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,515 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,793 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375)))) is different from true [2022-11-03 03:04:08,814 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 03:04:08,830 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5378))) (exists ((v_ArrVal_5379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5379) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5381) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,944 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5387) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5386) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 03:04:08,964 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:08,997 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5391))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2022-11-03 03:04:09,090 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:04:09,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 03:04:09,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 03:04:09,189 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:04:09,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 03:04:09,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 03:04:09,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 03:04:09,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 03:04:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2022-11-03 03:04:09,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:04:09,348 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5395) |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_5394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-03 03:04:09,393 WARN L833 $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_5394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-03 03:04:10,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5486 (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_5486) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5487) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5487))) (let ((.cse2 (select (select .cse3 |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_5486) .cse2 v_ArrVal_5395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5394) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-03 03:04:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199091590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:04:10,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:04:10,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 32] total 86 [2022-11-03 03:04:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030229061] [2022-11-03 03:04:10,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:04:10,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-03 03:04:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 03:04:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-03 03:04:10,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=205, Unknown=92, NotChecked=9010, Total=9506 [2022-11-03 03:04:10,665 INFO L87 Difference]: Start difference. First operand 1891 states and 2084 transitions. Second operand has 87 states, 85 states have (on average 2.364705882352941) internal successors, (201), 87 states have internal predecessors, (201), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:04:11,490 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4211 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4211) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307))) (exists ((v_ArrVal_4760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4760)))) is different from true [2022-11-03 03:04:11,505 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4829))) (exists ((v_ArrVal_5387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4845))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_5386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 03:04:11,527 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4829))) (exists ((v_ArrVal_5387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831))) (exists ((v_ArrVal_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782))) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4845))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771))) (exists ((v_ArrVal_5386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 03:04:11,549 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4829))) (exists ((v_ArrVal_5387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_5391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5391))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831))) (exists ((v_ArrVal_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832))) (exists ((v_ArrVal_5378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5378))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782))) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_5379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4845))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774))) (exists ((v_ArrVal_5386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 03:04:11,574 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335))) (exists ((v_ArrVal_4846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4829))) (exists ((v_ArrVal_5387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_5391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5391))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5381) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4836))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831))) (exists ((v_ArrVal_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832))) (exists ((v_ArrVal_5378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5378))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782))) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_5379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4845))) (exists ((v_ArrVal_4835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4835) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774))) (exists ((v_ArrVal_5386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 03:04:11,599 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335))) (exists ((v_ArrVal_4846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4829))) (exists ((v_ArrVal_5387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357))) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_5391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5391))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5381) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4836))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831))) (exists ((v_ArrVal_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_4239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4239))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832))) (exists ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4837))) (exists ((v_ArrVal_5378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5378))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4240))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782))) (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_5379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4845))) (exists ((v_ArrVal_4835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4835) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774))) (exists ((v_ArrVal_5386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_ArrVal_4838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4838))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 03:04:11,625 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335))) (exists ((v_ArrVal_4846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4829))) (exists ((v_ArrVal_5387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357))) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_5391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5391))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4839))) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5381) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4840))) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4836))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831))) (exists ((v_ArrVal_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_4239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4239))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832))) (exists ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4837))) (exists ((v_ArrVal_5378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5378))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4240))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782))) (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_5379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4845))) (exists ((v_ArrVal_4835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4835) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774))) (exists ((v_ArrVal_5386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_ArrVal_4838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4838))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 03:04:11,651 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5351 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5351))) (exists ((v_ArrVal_4772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4772))) (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4792) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5390) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335))) (exists ((v_ArrVal_4842 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4842))) (exists ((v_ArrVal_4846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4846) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4220) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4791) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4829))) (exists ((v_ArrVal_5387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5387) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5357))) (exists ((v_ArrVal_4810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4810))) (exists ((v_ArrVal_4765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4765))) (exists ((v_ArrVal_5391 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5391))) (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_ArrVal_5361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5361))) (exists ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5348) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_ArrVal_4804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4804))) (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775))) (exists ((v_ArrVal_4764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4764))) (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4833))) (exists ((v_ArrVal_4800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4800))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331))) (exists ((v_ArrVal_5374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5374) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4221 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4221))) (exists ((v_ArrVal_4785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5352))) (exists ((v_ArrVal_4784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4784) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4839))) (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_ArrVal_5350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5350) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4806) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5381 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5381) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5354 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5354) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4820) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5349))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781))) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333))) (exists ((v_ArrVal_4798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4798) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5377))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215))) (exists ((v_ArrVal_4235 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4235))) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290))) (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319))) (exists ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4840))) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296))) (exists ((v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4770) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4819))) (exists ((v_ArrVal_4836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4836))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320))) (exists ((v_ArrVal_4841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4841))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4222))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_4797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4797) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4803))) (exists ((v_ArrVal_4831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4831))) (exists ((v_ArrVal_5388 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5388))) (exists ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4236))) (exists ((v_ArrVal_4239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4239))) (exists ((v_ArrVal_5360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5360) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4238) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217))) (exists ((v_ArrVal_4815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4815))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244))) (exists ((v_ArrVal_4832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4832))) (exists ((v_ArrVal_4837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4837))) (exists ((v_ArrVal_5378 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5378))) (exists ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4226))) (exists ((v_ArrVal_4234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4234))) (exists ((v_ArrVal_4225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4225))) (exists ((v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233))) (exists ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4805))) (exists ((v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4253))) (exists ((v_ArrVal_4824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4824) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4240))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_4799 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4799) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4782))) (exists ((v_ArrVal_5356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5389 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5389))) (exists ((v_ArrVal_4823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4823))) (exists ((v_ArrVal_4269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4269))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4237) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4783))) (exists ((v_ArrVal_4809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4809))) (exists ((v_ArrVal_4834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4834))) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310))) (exists ((v_ArrVal_5379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5355))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216))) (exists ((v_ArrVal_4227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4227))) (exists ((v_ArrVal_4263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4263))) (exists ((v_ArrVal_4231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4231))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5380))) (exists ((v_ArrVal_4786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4786))) (exists ((v_ArrVal_4773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4223))) (exists ((v_ArrVal_4845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4845))) (exists ((v_ArrVal_4835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4835) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_4771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4771))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774))) (exists ((v_ArrVal_5386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5386) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4243) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213))) (exists ((v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5376) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4816 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4816))) (exists ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5375))) (exists ((v_ArrVal_5353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_ArrVal_4838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4838))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4224))) (exists ((v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4262))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-11-03 03:04:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:04:43,325 INFO L93 Difference]: Finished difference Result 3525 states and 3818 transitions. [2022-11-03 03:04:43,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 03:04:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 85 states have (on average 2.364705882352941) internal successors, (201), 87 states have internal predecessors, (201), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 113 [2022-11-03 03:04:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:04:43,337 INFO L225 Difference]: With dead ends: 3525 [2022-11-03 03:04:43,337 INFO L226 Difference]: Without dead ends: 3525 [2022-11-03 03:04:43,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 201 SyntacticMatches, 61 SemanticMatches, 113 ConstructedPredicates, 93 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=280, Invalid=446, Unknown=108, NotChecked=12276, Total=13110 [2022-11-03 03:04:43,340 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 2831 mSDsluCounter, 7639 mSDsCounter, 0 mSdLazyCounter, 10133 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2846 SdHoareTripleChecker+Valid, 9170 SdHoareTripleChecker+Invalid, 235254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 10133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225075 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:04:43,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2846 Valid, 9170 Invalid, 235254 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [46 Valid, 10133 Invalid, 0 Unknown, 225075 Unchecked, 31.1s Time] [2022-11-03 03:04:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2022-11-03 03:04:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 1890. [2022-11-03 03:04:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1194 states have (on average 1.7244556113902847) internal successors, (2059), 1879 states have internal predecessors, (2059), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 03:04:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2083 transitions. [2022-11-03 03:04:43,381 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2083 transitions. Word has length 113 [2022-11-03 03:04:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:04:43,382 INFO L495 AbstractCegarLoop]: Abstraction has 1890 states and 2083 transitions. [2022-11-03 03:04:43,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 85 states have (on average 2.364705882352941) internal successors, (201), 87 states have internal predecessors, (201), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:04:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2083 transitions. [2022-11-03 03:04:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-03 03:04:43,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:04:43,384 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:04:43,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-03 03:04:43,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 03:04:43,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-03 03:04:44,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 03:04:44,001 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-11-03 03:04:44,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:04:44,002 INFO L85 PathProgramCache]: Analyzing trace with hash 276276933, now seen corresponding path program 1 times [2022-11-03 03:04:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 03:04:44,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702073150] [2022-11-03 03:04:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:04:44,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 03:04:44,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 03:04:44,005 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 03:04:44,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-03 03:04:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:04:45,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 03:04:45,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:04:45,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:04:45,640 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 03:04:45,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 03:04:45,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:04:45,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 03:04:47,747 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_61 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (_ bv0 1)) (not (= v_arrayElimCell_61 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_61)) (_ bv0 1)))) (exists ((v_ArrVal_5904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5904)))) is different from true [2022-11-03 03:04:48,169 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:04:48,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 03:04:48,325 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:04:48,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 03:04:48,453 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:04:48,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 03:04:48,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 03:04:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-03 03:04:48,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:04:48,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5912) |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-03 03:04:48,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_5912) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 03:04:48,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5912 (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~mem35#1.base| v_ArrVal_5911))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5912)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 03:04:48,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5912 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5911))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5912)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 03:04:49,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5911 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5958))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5911)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5912)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-03 03:04:49,063 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 03:04:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702073150] [2022-11-03 03:04:49,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702073150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:04:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1670664435] [2022-11-03 03:04:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:04:49,063 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 03:04:49,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 03:04:49,065 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 03:04:49,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0f0b6-8053-4bcc-ae61-fb118816a621/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-03 03:05:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:05:21,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-03 03:05:21,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:05:21,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 03:05:21,952 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 03:05:21,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 03:05:22,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:05:22,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:05:22,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 03:05:22,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:05:22,971 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6345)))) is different from true [2022-11-03 03:05:23,638 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6352)))) is different from true [2022-11-03 03:05:24,080 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6357 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6357)))) is different from true [2022-11-03 03:05:24,752 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6364)))) is different from true [2022-11-03 03:05:24,878 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6366 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6366) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 03:05:24,899 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_8|)) (_ bv0 1)))) (exists ((v_ArrVal_6367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6367) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 03:05:26,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:05:26,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:26,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2022-11-03 03:05:26,987 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-03 03:05:26,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 03:05:27,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 03:05:27,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:27,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:27,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:27,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:05:27,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-11-03 03:05:27,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:05:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-03 03:05:27,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:05:30,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273030 treesize of output 186672