./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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 c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 --- 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 01:43:13,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:43:13,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:43:13,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:43:13,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:43:13,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:43:13,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:43:13,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:43:13,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:43:13,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:43:13,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:43:13,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:43:13,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:43:13,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:43:13,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:43:13,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:43:13,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:43:13,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:43:13,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:43:13,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:43:13,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:43:13,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:43:13,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:43:13,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:43:13,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:43:13,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:43:13,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:43:13,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:43:13,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:43:13,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:43:13,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:43:13,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:43:13,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:43:13,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:43:13,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:43:13,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:43:13,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:43:13,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:43:13,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:43:13,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:43:13,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:43:13,996 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:43:14,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:43:14,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:43:14,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:43:14,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:43:14,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:43:14,032 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:43:14,032 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:43:14,032 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:43:14,032 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:43:14,033 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:43:14,034 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:43:14,034 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:43:14,034 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:43:14,034 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:43:14,035 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:43:14,035 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:43:14,035 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:43:14,035 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:43:14,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:43:14,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:43:14,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:43:14,037 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:43:14,037 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:43:14,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:43:14,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:43:14,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:43:14,038 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:43:14,038 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:43:14,039 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:43:14,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:43:14,039 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:43:14,039 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:43:14,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:43:14,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:43:14,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:43:14,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:43:14,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:43:14,041 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:43:14,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:43:14,041 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:43:14,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:43:14,042 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:43:14,042 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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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 -> c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 [2022-11-03 01:43:14,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:43:14,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:43:14,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:43:14,424 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:43:14,425 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:43:14,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-03 01:43:14,507 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data/0d9e4ae82/40cca52081984515b426d1703b47625a/FLAG50fc71577 [2022-11-03 01:43:15,156 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:43:15,157 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-03 01:43:15,187 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data/0d9e4ae82/40cca52081984515b426d1703b47625a/FLAG50fc71577 [2022-11-03 01:43:15,401 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data/0d9e4ae82/40cca52081984515b426d1703b47625a [2022-11-03 01:43:15,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:43:15,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:43:15,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:43:15,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:43:15,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:43:15,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:15" (1/1) ... [2022-11-03 01:43:15,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167fa117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:15, skipping insertion in model container [2022-11-03 01:43:15,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:15" (1/1) ... [2022-11-03 01:43:15,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:43:15,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:43:15,998 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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-03 01:43:16,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:43:16,310 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 01:43:16,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@354e06d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:16, skipping insertion in model container [2022-11-03 01:43:16,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:43:16,312 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-03 01:43:16,314 INFO L158 Benchmark]: Toolchain (without parser) took 908.06ms. Allocated memory is still 109.1MB. Free memory was 75.8MB in the beginning and 63.2MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 01:43:16,314 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 88.1MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:43:16,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 905.30ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 63.2MB in the end (delta: 12.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 01:43:16,317 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.33ms. Allocated memory is still 88.1MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 905.30ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 63.2MB in the end (delta: 12.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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 c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 --- 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 01:43:18,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:43:18,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:43:18,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:43:18,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:43:18,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:43:18,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:43:18,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:43:18,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:43:18,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:43:18,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:43:18,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:43:18,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:43:18,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:43:18,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:43:18,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:43:18,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:43:18,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:43:18,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:43:18,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:43:18,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:43:18,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:43:18,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:43:18,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:43:18,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:43:18,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:43:18,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:43:18,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:43:18,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:43:18,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:43:18,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:43:18,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:43:18,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:43:18,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:43:18,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:43:18,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:43:18,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:43:18,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:43:18,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:43:18,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:43:18,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:43:18,765 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 01:43:18,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:43:18,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:43:18,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:43:18,822 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:43:18,823 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:43:18,823 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:43:18,823 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:43:18,824 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:43:18,824 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:43:18,824 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:43:18,825 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:43:18,825 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:43:18,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:43:18,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:43:18,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:43:18,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:43:18,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:43:18,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:43:18,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:43:18,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:43:18,829 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:43:18,829 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:43:18,829 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:43:18,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:43:18,829 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:43:18,830 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 01:43:18,830 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 01:43:18,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:43:18,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:43:18,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:43:18,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 01:43:18,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:43:18,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:43:18,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:43:18,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:43:18,832 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 01:43:18,832 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 01:43:18,833 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:43:18,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 01:43:18,833 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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/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 -> c098eb2ea0abe7b0f4b25f613d67df9ef36b2215e5396f258b75924d2167f9c8 [2022-11-03 01:43:19,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:43:19,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:43:19,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:43:19,288 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:43:19,289 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:43:19,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-03 01:43:19,361 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data/fcf7f0a59/3c2c47f5400946a39ffecfdfdd5ca170/FLAGb155a8af3 [2022-11-03 01:43:20,103 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:43:20,104 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2022-11-03 01:43:20,134 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data/fcf7f0a59/3c2c47f5400946a39ffecfdfdd5ca170/FLAGb155a8af3 [2022-11-03 01:43:20,306 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/data/fcf7f0a59/3c2c47f5400946a39ffecfdfdd5ca170 [2022-11-03 01:43:20,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:43:20,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:43:20,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:43:20,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:43:20,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:43:20,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:20" (1/1) ... [2022-11-03 01:43:20,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b2f15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:20, skipping insertion in model container [2022-11-03 01:43:20,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:20" (1/1) ... [2022-11-03 01:43:20,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:43:20,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:43:20,928 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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-03 01:43:21,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:43:21,226 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 01:43:21,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:43:21,282 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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-03 01:43:21,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:43:21,430 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:43:21,454 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_6d3eb362-89be-424d-92dc-67bd3c54d4ed/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] [2022-11-03 01:43:21,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:43:21,633 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:43:21,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21 WrapperNode [2022-11-03 01:43:21,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:43:21,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:43:21,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:43:21,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:43:21,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:21,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:21,831 INFO L138 Inliner]: procedures = 180, calls = 623, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2491 [2022-11-03 01:43:21,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:43:21,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:43:21,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:43:21,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:43:21,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:21,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:21,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:21,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:21,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:21,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:21,998 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:22,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:22,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:43:22,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:43:22,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:43:22,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:43:22,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (1/1) ... [2022-11-03 01:43:22,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:43:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:22,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:43:22,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:43:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-03 01:43:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-11-03 01:43:22,148 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-11-03 01:43:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 01:43:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 01:43:22,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 01:43:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-03 01:43:22,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-03 01:43:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:43:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:43:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:43:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:43:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-03 01:43:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:43:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:43:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 01:43:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 01:43:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:43:22,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:43:22,631 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:43:22,633 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:43:22,637 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 01:43:34,659 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:43:34,678 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:43:34,678 INFO L300 CfgBuilder]: Removed 168 assume(true) statements. [2022-11-03 01:43:34,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:43:34 BoogieIcfgContainer [2022-11-03 01:43:34,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:43:34,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:43:34,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:43:34,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:43:34,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:43:20" (1/3) ... [2022-11-03 01:43:34,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420dc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:43:34, skipping insertion in model container [2022-11-03 01:43:34,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:21" (2/3) ... [2022-11-03 01:43:34,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420dc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:43:34, skipping insertion in model container [2022-11-03 01:43:34,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:43:34" (3/3) ... [2022-11-03 01:43:34,692 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-3.i [2022-11-03 01:43:34,712 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:43:34,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1193 error locations. [2022-11-03 01:43:34,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:43:34,799 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;@1febae3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:43:34,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1193 error locations. [2022-11-03 01:43:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 2437 states, 1232 states have (on average 2.2280844155844157) internal successors, (2745), 2423 states have internal predecessors, (2745), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-03 01:43:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:43:34,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:34,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:43:34,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:43:34,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-11-03 01:43:34,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:43:34,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134586722] [2022-11-03 01:43:34,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:34,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:43:34,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:43:34,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:43:34,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 01:43:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:35,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:43:35,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:35,224 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 01:43:35,250 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 01:43:35,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:43:35,251 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:43:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134586722] [2022-11-03 01:43:35,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134586722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:35,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:35,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054027410] [2022-11-03 01:43:35,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:35,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:43:35,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:35,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:35,323 INFO L87 Difference]: Start difference. First operand has 2437 states, 1232 states have (on average 2.2280844155844157) internal successors, (2745), 2423 states have internal predecessors, (2745), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:41,211 INFO L93 Difference]: Finished difference Result 3281 states and 3483 transitions. [2022-11-03 01:43:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:41,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 01:43:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:41,245 INFO L225 Difference]: With dead ends: 3281 [2022-11-03 01:43:41,245 INFO L226 Difference]: Without dead ends: 3279 [2022-11-03 01:43:41,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:41,250 INFO L413 NwaCegarLoop]: 1665 mSDtfsCounter, 2318 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2328 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:41,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2328 Valid, 2230 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-03 01:43:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-11-03 01:43:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2579. [2022-11-03 01:43:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 1398 states have (on average 2.067238912732475) internal successors, (2890), 2563 states have internal predecessors, (2890), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-03 01:43:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 2922 transitions. [2022-11-03 01:43:41,388 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 2922 transitions. Word has length 3 [2022-11-03 01:43:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:41,389 INFO L495 AbstractCegarLoop]: Abstraction has 2579 states and 2922 transitions. [2022-11-03 01:43:41,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:41,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 2922 transitions. [2022-11-03 01:43:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:43:41,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:41,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:43:41,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:43:41,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:43:41,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-11-03 01:43:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:43:41,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890565660] [2022-11-03 01:43:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:41,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:43:41,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:43:41,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:43:41,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 01:43:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:41,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:43:41,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:41,867 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 01:43:41,881 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 01:43:41,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:43:41,882 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:43:41,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890565660] [2022-11-03 01:43:41,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890565660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:41,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:41,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:41,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658197193] [2022-11-03 01:43:41,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:41,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:43:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:41,886 INFO L87 Difference]: Start difference. First operand 2579 states and 2922 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:49,866 INFO L93 Difference]: Finished difference Result 3727 states and 4170 transitions. [2022-11-03 01:43:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:49,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 01:43:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:49,881 INFO L225 Difference]: With dead ends: 3727 [2022-11-03 01:43:49,881 INFO L226 Difference]: Without dead ends: 3727 [2022-11-03 01:43:49,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:49,884 INFO L413 NwaCegarLoop]: 2045 mSDtfsCounter, 1240 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:49,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 3433 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-03 01:43:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2022-11-03 01:43:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3028. [2022-11-03 01:43:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 1845 states have (on average 2.0233062330623306) internal successors, (3733), 3009 states have internal predecessors, (3733), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-03 01:43:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 3771 transitions. [2022-11-03 01:43:49,973 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 3771 transitions. Word has length 3 [2022-11-03 01:43:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:49,973 INFO L495 AbstractCegarLoop]: Abstraction has 3028 states and 3771 transitions. [2022-11-03 01:43:49,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3771 transitions. [2022-11-03 01:43:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:43:49,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:49,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:49,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:50,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:43:50,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:43:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-11-03 01:43:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:43:50,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069688626] [2022-11-03 01:43:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:50,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:43:50,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:43:50,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:43:50,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 01:43:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:50,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:43:50,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:50,460 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 01:43:50,470 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 01:43:50,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:50,536 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 01:43:50,554 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:43:50,554 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 01:43:50,577 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 01:43:50,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:43:50,578 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:43:50,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069688626] [2022-11-03 01:43:50,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069688626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:50,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:50,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:43:50,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934893095] [2022-11-03 01:43:50,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:50,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:43:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:43:50,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:43:50,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:43:50,581 INFO L87 Difference]: Start difference. First operand 3028 states and 3771 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:05,915 INFO L93 Difference]: Finished difference Result 6006 states and 6937 transitions. [2022-11-03 01:44:05,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:44:05,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:44:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:05,935 INFO L225 Difference]: With dead ends: 6006 [2022-11-03 01:44:05,935 INFO L226 Difference]: Without dead ends: 6006 [2022-11-03 01:44:05,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:05,937 INFO L413 NwaCegarLoop]: 981 mSDtfsCounter, 3127 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:05,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3137 Valid, 3162 Invalid, 4747 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2022-11-03 01:44:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2022-11-03 01:44:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3747. [2022-11-03 01:44:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3747 states, 2564 states have (on average 2.0514820592823715) internal successors, (5260), 3722 states have internal predecessors, (5260), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3747 states to 3747 states and 5310 transitions. [2022-11-03 01:44:06,035 INFO L78 Accepts]: Start accepts. Automaton has 3747 states and 5310 transitions. Word has length 7 [2022-11-03 01:44:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:06,035 INFO L495 AbstractCegarLoop]: Abstraction has 3747 states and 5310 transitions. [2022-11-03 01:44:06,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3747 states and 5310 transitions. [2022-11-03 01:44:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:44:06,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:06,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:06,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:06,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:06,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-11-03 01:44:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:06,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487915940] [2022-11-03 01:44:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:06,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:06,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:06,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 01:44:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:06,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:44:06,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:06,465 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 01:44:06,479 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 01:44:06,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:06,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487915940] [2022-11-03 01:44:06,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487915940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:06,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:06,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:44:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350875928] [2022-11-03 01:44:06,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:06,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:06,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:06,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:06,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:06,482 INFO L87 Difference]: Start difference. First operand 3747 states and 5310 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:11,110 INFO L93 Difference]: Finished difference Result 4951 states and 6827 transitions. [2022-11-03 01:44:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 01:44:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:11,126 INFO L225 Difference]: With dead ends: 4951 [2022-11-03 01:44:11,126 INFO L226 Difference]: Without dead ends: 4951 [2022-11-03 01:44:11,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:11,127 INFO L413 NwaCegarLoop]: 2366 mSDtfsCounter, 1998 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:11,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 3212 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-03 01:44:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2022-11-03 01:44:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 3656. [2022-11-03 01:44:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 2564 states have (on average 1.968408736349454) internal successors, (5047), 3631 states have internal predecessors, (5047), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5097 transitions. [2022-11-03 01:44:11,215 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5097 transitions. Word has length 8 [2022-11-03 01:44:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:11,215 INFO L495 AbstractCegarLoop]: Abstraction has 3656 states and 5097 transitions. [2022-11-03 01:44:11,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5097 transitions. [2022-11-03 01:44:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:44:11,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:11,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:11,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:11,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:11,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-11-03 01:44:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:11,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435980871] [2022-11-03 01:44:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:11,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:11,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:11,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:11,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 01:44:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:11,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:44:11,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:11,682 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 01:44:11,713 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 01:44:11,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:11,714 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:11,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435980871] [2022-11-03 01:44:11,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435980871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:11,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:11,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:44:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070574440] [2022-11-03 01:44:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:11,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:11,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:11,717 INFO L87 Difference]: Start difference. First operand 3656 states and 5097 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:18,909 INFO L93 Difference]: Finished difference Result 5371 states and 7455 transitions. [2022-11-03 01:44:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:18,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 01:44:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:18,951 INFO L225 Difference]: With dead ends: 5371 [2022-11-03 01:44:18,951 INFO L226 Difference]: Without dead ends: 5371 [2022-11-03 01:44:18,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:18,952 INFO L413 NwaCegarLoop]: 2746 mSDtfsCounter, 1369 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:18,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3931 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-03 01:44:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2022-11-03 01:44:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 3978. [2022-11-03 01:44:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 2896 states have (on average 1.9540745856353592) internal successors, (5659), 3953 states have internal predecessors, (5659), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5709 transitions. [2022-11-03 01:44:19,047 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5709 transitions. Word has length 8 [2022-11-03 01:44:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:19,047 INFO L495 AbstractCegarLoop]: Abstraction has 3978 states and 5709 transitions. [2022-11-03 01:44:19,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5709 transitions. [2022-11-03 01:44:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:44:19,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:19,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:19,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:19,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:19,261 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2022-11-03 01:44:19,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:19,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840945185] [2022-11-03 01:44:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:19,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:19,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:19,263 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:19,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 01:44:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:19,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:44:19,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:19,499 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 01:44:19,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:19,500 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:19,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840945185] [2022-11-03 01:44:19,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840945185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:19,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:19,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049284156] [2022-11-03 01:44:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:19,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:19,502 INFO L87 Difference]: Start difference. First operand 3978 states and 5709 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 01:44:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:19,555 INFO L93 Difference]: Finished difference Result 3918 states and 5623 transitions. [2022-11-03 01:44:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:19,556 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 01:44:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:19,588 INFO L225 Difference]: With dead ends: 3918 [2022-11-03 01:44:19,589 INFO L226 Difference]: Without dead ends: 3918 [2022-11-03 01:44:19,589 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 01:44:19,590 INFO L413 NwaCegarLoop]: 2407 mSDtfsCounter, 1197 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 3623 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 01:44:19,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 3623 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:44:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3918 states. [2022-11-03 01:44:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3918 to 3918. [2022-11-03 01:44:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 2860 states have (on average 1.9486013986013986) internal successors, (5573), 3893 states have internal predecessors, (5573), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5623 transitions. [2022-11-03 01:44:19,669 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5623 transitions. Word has length 11 [2022-11-03 01:44:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:19,670 INFO L495 AbstractCegarLoop]: Abstraction has 3918 states and 5623 transitions. [2022-11-03 01:44:19,670 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 01:44:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5623 transitions. [2022-11-03 01:44:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 01:44:19,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:19,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:19,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-03 01:44:19,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:19,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2022-11-03 01:44:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:19,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760843641] [2022-11-03 01:44:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:19,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:19,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:19,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:19,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 01:44:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:20,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:44:20,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:20,120 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 01:44:20,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:20,121 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:20,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760843641] [2022-11-03 01:44:20,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760843641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:20,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:20,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:44:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224031456] [2022-11-03 01:44:20,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:20,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:20,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:20,124 INFO L87 Difference]: Start difference. First operand 3918 states and 5623 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 01:44:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:20,255 INFO L93 Difference]: Finished difference Result 3890 states and 5567 transitions. [2022-11-03 01:44:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:44:20,256 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 01:44:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:20,265 INFO L225 Difference]: With dead ends: 3890 [2022-11-03 01:44:20,265 INFO L226 Difference]: Without dead ends: 3890 [2022-11-03 01:44:20,266 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 01:44:20,267 INFO L413 NwaCegarLoop]: 2362 mSDtfsCounter, 1168 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 5933 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 01:44:20,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 5933 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2022-11-03 01:44:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3888. [2022-11-03 01:44:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 2844 states have (on average 1.939170182841069) internal successors, (5515), 3863 states have internal predecessors, (5515), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 5565 transitions. [2022-11-03 01:44:20,357 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 5565 transitions. Word has length 13 [2022-11-03 01:44:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:20,357 INFO L495 AbstractCegarLoop]: Abstraction has 3888 states and 5565 transitions. [2022-11-03 01:44:20,358 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 01:44:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 5565 transitions. [2022-11-03 01:44:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:44:20,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:20,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:20,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:20,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:20,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-11-03 01:44:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:20,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437470617] [2022-11-03 01:44:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:20,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:20,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:20,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:20,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 01:44:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:20,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:44:20,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:20,834 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 01:44:20,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:20,834 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:20,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437470617] [2022-11-03 01:44:20,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437470617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:20,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:20,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089669798] [2022-11-03 01:44:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:20,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:20,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:20,837 INFO L87 Difference]: Start difference. First operand 3888 states and 5565 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:20,902 INFO L93 Difference]: Finished difference Result 5514 states and 7318 transitions. [2022-11-03 01:44:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:20,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 01:44:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:20,915 INFO L225 Difference]: With dead ends: 5514 [2022-11-03 01:44:20,915 INFO L226 Difference]: Without dead ends: 5514 [2022-11-03 01:44:20,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 01:44:20,917 INFO L413 NwaCegarLoop]: 4091 mSDtfsCounter, 2288 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 5893 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 01:44:20,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 5893 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:44:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states. [2022-11-03 01:44:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 3828. [2022-11-03 01:44:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3828 states, 2808 states have (on average 1.9334045584045585) internal successors, (5429), 3803 states have internal predecessors, (5429), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5479 transitions. [2022-11-03 01:44:21,011 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5479 transitions. Word has length 20 [2022-11-03 01:44:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:21,011 INFO L495 AbstractCegarLoop]: Abstraction has 3828 states and 5479 transitions. [2022-11-03 01:44:21,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5479 transitions. [2022-11-03 01:44:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:44:21,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:21,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:21,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:21,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:21,213 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:21,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2022-11-03 01:44:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:21,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696738106] [2022-11-03 01:44:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:21,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:21,216 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:21,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 01:44:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:21,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:44:21,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:21,511 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 01:44:21,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:21,512 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:21,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696738106] [2022-11-03 01:44:21,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696738106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:21,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:21,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:21,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783342958] [2022-11-03 01:44:21,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:21,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:44:21,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:21,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:44:21,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:44:21,516 INFO L87 Difference]: Start difference. First operand 3828 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:21,571 INFO L93 Difference]: Finished difference Result 5347 states and 7027 transitions. [2022-11-03 01:44:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:44:21,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 01:44:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:21,583 INFO L225 Difference]: With dead ends: 5347 [2022-11-03 01:44:21,583 INFO L226 Difference]: Without dead ends: 5347 [2022-11-03 01:44:21,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 01:44:21,584 INFO L413 NwaCegarLoop]: 3778 mSDtfsCounter, 2245 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 5532 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 01:44:21,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 5532 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:44:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2022-11-03 01:44:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 3696. [2022-11-03 01:44:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2700 states have (on average 1.915185185185185) internal successors, (5171), 3671 states have internal predecessors, (5171), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5221 transitions. [2022-11-03 01:44:21,645 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5221 transitions. Word has length 20 [2022-11-03 01:44:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:21,646 INFO L495 AbstractCegarLoop]: Abstraction has 3696 states and 5221 transitions. [2022-11-03 01:44:21,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5221 transitions. [2022-11-03 01:44:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:44:21,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:21,647 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] [2022-11-03 01:44:21,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-03 01:44:21,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:21,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:21,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:21,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-11-03 01:44:21,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:21,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479725519] [2022-11-03 01:44:21,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:21,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:21,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:21,863 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:21,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 01:44:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:22,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:44:22,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:22,187 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 01:44:22,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:22,187 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:22,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479725519] [2022-11-03 01:44:22,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479725519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:22,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:22,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:44:22,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937684545] [2022-11-03 01:44:22,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:22,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:22,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:22,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:22,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:22,190 INFO L87 Difference]: Start difference. First operand 3696 states and 5221 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 01:44:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:22,335 INFO L93 Difference]: Finished difference Result 5312 states and 6961 transitions. [2022-11-03 01:44:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:44:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-03 01:44:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:22,347 INFO L225 Difference]: With dead ends: 5312 [2022-11-03 01:44:22,347 INFO L226 Difference]: Without dead ends: 5312 [2022-11-03 01:44:22,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 01:44:22,348 INFO L413 NwaCegarLoop]: 3960 mSDtfsCounter, 2216 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 9672 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 01:44:22,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 9672 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2022-11-03 01:44:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 3666. [2022-11-03 01:44:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2684 states have (on average 1.9049925484351713) internal successors, (5113), 3641 states have internal predecessors, (5113), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 5163 transitions. [2022-11-03 01:44:22,412 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 5163 transitions. Word has length 22 [2022-11-03 01:44:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:22,412 INFO L495 AbstractCegarLoop]: Abstraction has 3666 states and 5163 transitions. [2022-11-03 01:44:22,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 01:44:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 5163 transitions. [2022-11-03 01:44:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:44:22,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:22,418 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] [2022-11-03 01:44:22,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-11-03 01:44:22,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:22,631 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2022-11-03 01:44:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:22,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14499325] [2022-11-03 01:44:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:22,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:22,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:22,633 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:22,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 01:44:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:22,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:44:22,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:22,912 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 01:44:22,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:22,912 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:22,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14499325] [2022-11-03 01:44:22,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14499325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:22,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:22,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:44:22,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163735708] [2022-11-03 01:44:22,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:22,915 INFO L87 Difference]: Start difference. First operand 3666 states and 5163 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 01:44:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:23,057 INFO L93 Difference]: Finished difference Result 5239 states and 6772 transitions. [2022-11-03 01:44:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:44:23,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-03 01:44:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:23,069 INFO L225 Difference]: With dead ends: 5239 [2022-11-03 01:44:23,069 INFO L226 Difference]: Without dead ends: 5239 [2022-11-03 01:44:23,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 01:44:23,070 INFO L413 NwaCegarLoop]: 3885 mSDtfsCounter, 2181 mSDsluCounter, 5597 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 9482 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 01:44:23,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 9482 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2022-11-03 01:44:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 3604. [2022-11-03 01:44:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2636 states have (on average 1.8736722306525038) internal successors, (4939), 3579 states have internal predecessors, (4939), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4989 transitions. [2022-11-03 01:44:23,136 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4989 transitions. Word has length 22 [2022-11-03 01:44:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:23,138 INFO L495 AbstractCegarLoop]: Abstraction has 3604 states and 4989 transitions. [2022-11-03 01:44:23,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 01:44:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4989 transitions. [2022-11-03 01:44:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 01:44:23,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:23,140 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 01:44:23,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:23,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:23,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2022-11-03 01:44:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:23,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168208364] [2022-11-03 01:44:23,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:23,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:23,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:23,355 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:23,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 01:44:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:23,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:44:23,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:23,586 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 01:44:23,669 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 01:44:23,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:23,670 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168208364] [2022-11-03 01:44:23,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168208364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:23,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:23,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892076681] [2022-11-03 01:44:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:23,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:23,672 INFO L87 Difference]: Start difference. First operand 3604 states and 4989 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 01:44:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:29,165 INFO L93 Difference]: Finished difference Result 4225 states and 5525 transitions. [2022-11-03 01:44:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:44:29,166 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 01:44:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:29,175 INFO L225 Difference]: With dead ends: 4225 [2022-11-03 01:44:29,175 INFO L226 Difference]: Without dead ends: 4225 [2022-11-03 01:44:29,176 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 01:44:29,176 INFO L413 NwaCegarLoop]: 1515 mSDtfsCounter, 3097 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3103 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:29,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3103 Valid, 2793 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-03 01:44:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2022-11-03 01:44:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 3600. [2022-11-03 01:44:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2636 states have (on average 1.8706373292867982) internal successors, (4931), 3575 states have internal predecessors, (4931), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4981 transitions. [2022-11-03 01:44:29,230 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4981 transitions. Word has length 27 [2022-11-03 01:44:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:29,231 INFO L495 AbstractCegarLoop]: Abstraction has 3600 states and 4981 transitions. [2022-11-03 01:44:29,231 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 01:44:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4981 transitions. [2022-11-03 01:44:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 01:44:29,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:29,233 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 01:44:29,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:29,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:29,445 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:29,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2022-11-03 01:44:29,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:29,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284512396] [2022-11-03 01:44:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:29,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:29,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:29,448 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:29,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 01:44:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:29,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:44:29,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:29,747 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 01:44:29,926 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 01:44:29,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:29,927 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:29,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284512396] [2022-11-03 01:44:29,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284512396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:29,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:29,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:29,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335549245] [2022-11-03 01:44:29,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:29,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:29,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:29,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:29,929 INFO L87 Difference]: Start difference. First operand 3600 states and 4981 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 01:44:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:38,528 INFO L93 Difference]: Finished difference Result 4679 states and 6151 transitions. [2022-11-03 01:44:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:44:38,529 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 01:44:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:38,539 INFO L225 Difference]: With dead ends: 4679 [2022-11-03 01:44:38,539 INFO L226 Difference]: Without dead ends: 4679 [2022-11-03 01:44:38,540 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 01:44:38,540 INFO L413 NwaCegarLoop]: 1748 mSDtfsCounter, 2279 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2279 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:38,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2279 Valid, 4099 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-03 01:44:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2022-11-03 01:44:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 3636. [2022-11-03 01:44:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 2672 states have (on average 1.8607784431137724) internal successors, (4972), 3611 states have internal predecessors, (4972), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5022 transitions. [2022-11-03 01:44:38,594 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5022 transitions. Word has length 27 [2022-11-03 01:44:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:38,595 INFO L495 AbstractCegarLoop]: Abstraction has 3636 states and 5022 transitions. [2022-11-03 01:44:38,595 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 01:44:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5022 transitions. [2022-11-03 01:44:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:44:38,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:38,596 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] [2022-11-03 01:44:38,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:38,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:38,809 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-11-03 01:44:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:38,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498305290] [2022-11-03 01:44:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:38,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:38,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:38,812 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:38,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-03 01:44:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:39,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:44:39,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:39,153 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 01:44:39,234 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 01:44:39,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:39,235 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:39,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498305290] [2022-11-03 01:44:39,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498305290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:39,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:39,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081271637] [2022-11-03 01:44:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:39,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:39,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:39,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:39,237 INFO L87 Difference]: Start difference. First operand 3636 states and 5022 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 01:44:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:46,722 INFO L93 Difference]: Finished difference Result 7033 states and 9556 transitions. [2022-11-03 01:44:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:44:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-03 01:44:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:46,737 INFO L225 Difference]: With dead ends: 7033 [2022-11-03 01:44:46,737 INFO L226 Difference]: Without dead ends: 7033 [2022-11-03 01:44:46,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 01:44:46,738 INFO L413 NwaCegarLoop]: 2580 mSDtfsCounter, 4500 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:46,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 4978 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-03 01:44:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2022-11-03 01:44:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 3632. [2022-11-03 01:44:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 2672 states have (on average 1.8577844311377245) internal successors, (4964), 3607 states have internal predecessors, (4964), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5014 transitions. [2022-11-03 01:44:46,815 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5014 transitions. Word has length 36 [2022-11-03 01:44:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:46,816 INFO L495 AbstractCegarLoop]: Abstraction has 3632 states and 5014 transitions. [2022-11-03 01:44:46,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 01:44:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5014 transitions. [2022-11-03 01:44:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:44:46,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:46,817 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] [2022-11-03 01:44:46,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:47,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:47,030 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:47,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:47,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-11-03 01:44:47,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:47,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305117508] [2022-11-03 01:44:47,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:47,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:47,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:47,034 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:47,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 01:44:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:47,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:44:47,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:47,357 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 01:44:47,561 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 01:44:47,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:47,562 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:47,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305117508] [2022-11-03 01:44:47,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305117508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:47,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:47,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252458168] [2022-11-03 01:44:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:47,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:47,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:47,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:47,563 INFO L87 Difference]: Start difference. First operand 3632 states and 5014 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 01:44:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:58,541 INFO L93 Difference]: Finished difference Result 6725 states and 8957 transitions. [2022-11-03 01:44:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:44:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-03 01:44:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:58,551 INFO L225 Difference]: With dead ends: 6725 [2022-11-03 01:44:58,551 INFO L226 Difference]: Without dead ends: 6725 [2022-11-03 01:44:58,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 01:44:58,552 INFO L413 NwaCegarLoop]: 2937 mSDtfsCounter, 3252 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3256 SdHoareTripleChecker+Valid, 5833 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:58,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3256 Valid, 5833 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-11-03 01:44:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2022-11-03 01:44:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 3628. [2022-11-03 01:44:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 2672 states have (on average 1.8547904191616766) internal successors, (4956), 3603 states have internal predecessors, (4956), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:44:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 5006 transitions. [2022-11-03 01:44:58,637 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 5006 transitions. Word has length 36 [2022-11-03 01:44:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:58,639 INFO L495 AbstractCegarLoop]: Abstraction has 3628 states and 5006 transitions. [2022-11-03 01:44:58,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 01:44:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 5006 transitions. [2022-11-03 01:44:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:44:58,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:58,640 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] [2022-11-03 01:44:58,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-03 01:44:58,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:44:58,853 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:44:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2022-11-03 01:44:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:44:58,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749668621] [2022-11-03 01:44:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:58,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:44:58,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:44:58,857 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:44:58,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 01:44:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:59,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:44:59,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:59,182 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 01:44:59,281 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 01:44:59,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:59,281 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:59,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749668621] [2022-11-03 01:44:59,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749668621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:59,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:59,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:44:59,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423071589] [2022-11-03 01:44:59,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:59,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:44:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:59,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:44:59,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:44:59,284 INFO L87 Difference]: Start difference. First operand 3628 states and 5006 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 01:45:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:07,985 INFO L93 Difference]: Finished difference Result 7477 states and 10068 transitions. [2022-11-03 01:45:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:45:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-03 01:45:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:07,997 INFO L225 Difference]: With dead ends: 7477 [2022-11-03 01:45:07,997 INFO L226 Difference]: Without dead ends: 7477 [2022-11-03 01:45:07,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 01:45:07,998 INFO L413 NwaCegarLoop]: 2542 mSDtfsCounter, 4861 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4871 SdHoareTripleChecker+Valid, 5133 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:07,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4871 Valid, 5133 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-11-03 01:45:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-11-03 01:45:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 3625. [2022-11-03 01:45:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2672 states have (on average 1.846556886227545) internal successors, (4934), 3600 states have internal predecessors, (4934), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:45:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4984 transitions. [2022-11-03 01:45:08,093 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4984 transitions. Word has length 36 [2022-11-03 01:45:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:08,094 INFO L495 AbstractCegarLoop]: Abstraction has 3625 states and 4984 transitions. [2022-11-03 01:45:08,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 01:45:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4984 transitions. [2022-11-03 01:45:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:45:08,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:08,095 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] [2022-11-03 01:45:08,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:08,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:08,311 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2022-11-03 01:45:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:08,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876491359] [2022-11-03 01:45:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:08,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:08,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:08,314 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:08,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-03 01:45:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:08,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:45:08,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:08,652 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 01:45:08,851 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 01:45:08,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:08,852 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:08,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876491359] [2022-11-03 01:45:08,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876491359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:08,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:08,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:45:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056547753] [2022-11-03 01:45:08,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:08,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:08,854 INFO L87 Difference]: Start difference. First operand 3625 states and 4984 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 01:45:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:18,792 INFO L93 Difference]: Finished difference Result 5561 states and 7343 transitions. [2022-11-03 01:45:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:45:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-03 01:45:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:18,797 INFO L225 Difference]: With dead ends: 5561 [2022-11-03 01:45:18,797 INFO L226 Difference]: Without dead ends: 5561 [2022-11-03 01:45:18,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 01:45:18,798 INFO L413 NwaCegarLoop]: 2838 mSDtfsCounter, 2602 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 5307 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:18,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 5307 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-11-03 01:45:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states. [2022-11-03 01:45:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 3625. [2022-11-03 01:45:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2672 states have (on average 1.843562874251497) internal successors, (4926), 3600 states have internal predecessors, (4926), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:45:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4976 transitions. [2022-11-03 01:45:18,865 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4976 transitions. Word has length 36 [2022-11-03 01:45:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:18,865 INFO L495 AbstractCegarLoop]: Abstraction has 3625 states and 4976 transitions. [2022-11-03 01:45:18,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 01:45:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4976 transitions. [2022-11-03 01:45:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 01:45:18,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:18,867 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] [2022-11-03 01:45:18,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:19,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:19,090 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2022-11-03 01:45:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:19,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229027527] [2022-11-03 01:45:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:19,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:19,093 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:19,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 01:45:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:19,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:45:19,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:19,457 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 01:45:19,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:19,458 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:19,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229027527] [2022-11-03 01:45:19,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229027527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:19,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:19,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:19,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136818579] [2022-11-03 01:45:19,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:19,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:19,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:19,460 INFO L87 Difference]: Start difference. First operand 3625 states and 4976 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 01:45:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:19,545 INFO L93 Difference]: Finished difference Result 3613 states and 4952 transitions. [2022-11-03 01:45:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:19,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-11-03 01:45:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:19,551 INFO L225 Difference]: With dead ends: 3613 [2022-11-03 01:45:19,551 INFO L226 Difference]: Without dead ends: 3613 [2022-11-03 01:45:19,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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 01:45:19,552 INFO L413 NwaCegarLoop]: 2193 mSDtfsCounter, 1152 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 5414 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.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:19,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 5414 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:45:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2022-11-03 01:45:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3613. [2022-11-03 01:45:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 2660 states have (on average 1.8428571428571427) internal successors, (4902), 3588 states have internal predecessors, (4902), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:45:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 4952 transitions. [2022-11-03 01:45:19,641 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 4952 transitions. Word has length 40 [2022-11-03 01:45:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:19,642 INFO L495 AbstractCegarLoop]: Abstraction has 3613 states and 4952 transitions. [2022-11-03 01:45:19,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 01:45:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 4952 transitions. [2022-11-03 01:45:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 01:45:19,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:19,643 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] [2022-11-03 01:45:19,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:19,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:19,856 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2022-11-03 01:45:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:19,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116097422] [2022-11-03 01:45:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:19,858 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:19,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-03 01:45:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:20,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:45:20,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:20,393 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 01:45:20,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:20,393 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:20,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116097422] [2022-11-03 01:45:20,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116097422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:20,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:20,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:45:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551036121] [2022-11-03 01:45:20,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:20,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:45:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:20,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:45:20,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:45:20,395 INFO L87 Difference]: Start difference. First operand 3613 states and 4952 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 01:45:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:20,831 INFO L93 Difference]: Finished difference Result 5433 states and 7161 transitions. [2022-11-03 01:45:20,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:45:20,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2022-11-03 01:45:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:20,838 INFO L225 Difference]: With dead ends: 5433 [2022-11-03 01:45:20,839 INFO L226 Difference]: Without dead ends: 5433 [2022-11-03 01:45:20,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 01:45:20,839 INFO L413 NwaCegarLoop]: 2282 mSDtfsCounter, 1568 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 4321 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:20,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 4321 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:45:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2022-11-03 01:45:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 4630. [2022-11-03 01:45:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 3670 states have (on average 1.8258855585831062) internal successors, (6701), 4595 states have internal predecessors, (6701), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 01:45:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 6771 transitions. [2022-11-03 01:45:20,916 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 6771 transitions. Word has length 48 [2022-11-03 01:45:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:20,916 INFO L495 AbstractCegarLoop]: Abstraction has 4630 states and 6771 transitions. [2022-11-03 01:45:20,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 01:45:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 6771 transitions. [2022-11-03 01:45:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-03 01:45:20,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:20,917 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] [2022-11-03 01:45:20,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:21,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:21,131 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2022-11-03 01:45:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:21,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238068542] [2022-11-03 01:45:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:21,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:21,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:21,134 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:21,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-03 01:45:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:21,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:45:21,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:21,696 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 01:45:21,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:21,697 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:21,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238068542] [2022-11-03 01:45:21,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238068542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:21,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:21,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:21,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136381698] [2022-11-03 01:45:21,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:21,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:21,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:21,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:21,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:21,699 INFO L87 Difference]: Start difference. First operand 4630 states and 6771 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 01:45:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:21,800 INFO L93 Difference]: Finished difference Result 5942 states and 8145 transitions. [2022-11-03 01:45:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:21,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2022-11-03 01:45:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:21,810 INFO L225 Difference]: With dead ends: 5942 [2022-11-03 01:45:21,810 INFO L226 Difference]: Without dead ends: 5942 [2022-11-03 01:45:21,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 01:45:21,811 INFO L413 NwaCegarLoop]: 3432 mSDtfsCounter, 2151 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 8347 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.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:21,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 8347 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:45:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2022-11-03 01:45:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 4588. [2022-11-03 01:45:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4588 states, 3628 states have (on average 1.8277287761852261) internal successors, (6631), 4553 states have internal predecessors, (6631), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 01:45:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 6701 transitions. [2022-11-03 01:45:21,936 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 6701 transitions. Word has length 51 [2022-11-03 01:45:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:21,937 INFO L495 AbstractCegarLoop]: Abstraction has 4588 states and 6701 transitions. [2022-11-03 01:45:21,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 01:45:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 6701 transitions. [2022-11-03 01:45:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 01:45:21,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:21,938 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] [2022-11-03 01:45:21,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:22,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:22,159 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:22,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-11-03 01:45:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:22,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558530551] [2022-11-03 01:45:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:22,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:22,163 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:22,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 01:45:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:22,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:45:22,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:22,630 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 01:45:22,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:22,630 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:22,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558530551] [2022-11-03 01:45:22,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558530551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:22,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:22,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249997146] [2022-11-03 01:45:22,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:22,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:22,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:22,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:22,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:22,633 INFO L87 Difference]: Start difference. First operand 4588 states and 6701 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 01:45:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:22,732 INFO L93 Difference]: Finished difference Result 5678 states and 7631 transitions. [2022-11-03 01:45:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:22,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2022-11-03 01:45:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:22,741 INFO L225 Difference]: With dead ends: 5678 [2022-11-03 01:45:22,741 INFO L226 Difference]: Without dead ends: 5678 [2022-11-03 01:45:22,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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 01:45:22,743 INFO L413 NwaCegarLoop]: 3694 mSDtfsCounter, 2142 mSDsluCounter, 5226 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 8920 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 01:45:22,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 8920 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:45:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2022-11-03 01:45:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 4570. [2022-11-03 01:45:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4570 states, 3610 states have (on average 1.8285318559556787) internal successors, (6601), 4535 states have internal predecessors, (6601), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 01:45:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 6671 transitions. [2022-11-03 01:45:22,860 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 6671 transitions. Word has length 54 [2022-11-03 01:45:22,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:22,861 INFO L495 AbstractCegarLoop]: Abstraction has 4570 states and 6671 transitions. [2022-11-03 01:45:22,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 01:45:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 6671 transitions. [2022-11-03 01:45:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-03 01:45:22,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:22,862 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] [2022-11-03 01:45:22,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:23,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:23,078 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash -345082942, now seen corresponding path program 1 times [2022-11-03 01:45:23,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:23,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199854719] [2022-11-03 01:45:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:23,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:23,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:23,081 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:23,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-03 01:45:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:23,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:45:23,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:23,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:23,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:23,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 29 treesize of output 38 [2022-11-03 01:45:23,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:23,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2022-11-03 01:45:23,616 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 01:45:23,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:23,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:23,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199854719] [2022-11-03 01:45:23,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199854719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:23,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:23,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205844733] [2022-11-03 01:45:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:23,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:23,620 INFO L87 Difference]: Start difference. First operand 4570 states and 6671 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:26,094 INFO L93 Difference]: Finished difference Result 4797 states and 6909 transitions. [2022-11-03 01:45:26,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:26,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-03 01:45:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:26,108 INFO L225 Difference]: With dead ends: 4797 [2022-11-03 01:45:26,108 INFO L226 Difference]: Without dead ends: 4797 [2022-11-03 01:45:26,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:45:26,109 INFO L413 NwaCegarLoop]: 2071 mSDtfsCounter, 1031 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:26,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 5369 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 132 Unchecked, 2.4s Time] [2022-11-03 01:45:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2022-11-03 01:45:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4536. [2022-11-03 01:45:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3576 states have (on average 1.8361297539149888) internal successors, (6566), 4501 states have internal predecessors, (6566), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 01:45:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6636 transitions. [2022-11-03 01:45:26,184 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6636 transitions. Word has length 57 [2022-11-03 01:45:26,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:26,184 INFO L495 AbstractCegarLoop]: Abstraction has 4536 states and 6636 transitions. [2022-11-03 01:45:26,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6636 transitions. [2022-11-03 01:45:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-03 01:45:26,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:26,185 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] [2022-11-03 01:45:26,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:26,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:26,401 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2022-11-03 01:45:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:26,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37222536] [2022-11-03 01:45:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:26,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:26,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:26,403 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:26,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-03 01:45:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:26,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:45:26,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:45:27,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:27,077 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37222536] [2022-11-03 01:45:27,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37222536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:27,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:27,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:45:27,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714774760] [2022-11-03 01:45:27,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:27,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:45:27,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:27,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:45:27,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:45:27,079 INFO L87 Difference]: Start difference. First operand 4536 states and 6636 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 01:45:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:27,299 INFO L93 Difference]: Finished difference Result 6338 states and 8912 transitions. [2022-11-03 01:45:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:45:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-11-03 01:45:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:27,309 INFO L225 Difference]: With dead ends: 6338 [2022-11-03 01:45:27,309 INFO L226 Difference]: Without dead ends: 6338 [2022-11-03 01:45:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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 01:45:27,310 INFO L413 NwaCegarLoop]: 2414 mSDtfsCounter, 1265 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:27,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 4482 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:45:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-11-03 01:45:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5609. [2022-11-03 01:45:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 4641 states have (on average 1.810385692738634) internal successors, (8402), 5563 states have internal predecessors, (8402), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 01:45:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 8494 transitions. [2022-11-03 01:45:27,384 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 8494 transitions. Word has length 59 [2022-11-03 01:45:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:27,384 INFO L495 AbstractCegarLoop]: Abstraction has 5609 states and 8494 transitions. [2022-11-03 01:45:27,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 01:45:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 8494 transitions. [2022-11-03 01:45:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-03 01:45:27,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:27,385 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] [2022-11-03 01:45:27,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:27,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:27,600 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-11-03 01:45:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:27,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182279885] [2022-11-03 01:45:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:27,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:27,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:27,603 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:27,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-03 01:45:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:28,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:45:28,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:28,209 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 01:45:28,214 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 01:45:28,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:28,720 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 01:45:28,741 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:45:28,742 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 01:45:28,757 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 01:45:28,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:28,758 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:28,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182279885] [2022-11-03 01:45:28,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182279885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:28,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:28,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:45:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194628441] [2022-11-03 01:45:28,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:28,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:28,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:28,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:28,761 INFO L87 Difference]: Start difference. First operand 5609 states and 8494 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 01:45:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:35,612 INFO L93 Difference]: Finished difference Result 8028 states and 12217 transitions. [2022-11-03 01:45:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:35,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-11-03 01:45:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:35,622 INFO L225 Difference]: With dead ends: 8028 [2022-11-03 01:45:35,622 INFO L226 Difference]: Without dead ends: 8028 [2022-11-03 01:45:35,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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 01:45:35,623 INFO L413 NwaCegarLoop]: 1039 mSDtfsCounter, 2474 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:35,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2488 Valid, 1766 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-03 01:45:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8028 states. [2022-11-03 01:45:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8028 to 5369. [2022-11-03 01:45:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 4485 states have (on average 1.7438127090301003) internal successors, (7821), 5323 states have internal predecessors, (7821), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 01:45:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 7913 transitions. [2022-11-03 01:45:35,710 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 7913 transitions. Word has length 62 [2022-11-03 01:45:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:35,710 INFO L495 AbstractCegarLoop]: Abstraction has 5369 states and 7913 transitions. [2022-11-03 01:45:35,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 01:45:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 7913 transitions. [2022-11-03 01:45:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 01:45:35,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:35,712 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 01:45:35,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-11-03 01:45:35,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:35,915 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:35,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-11-03 01:45:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:35,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746301270] [2022-11-03 01:45:35,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:35,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:35,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:35,917 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:35,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-03 01:45:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:36,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:45:36,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:36,308 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 01:45:36,320 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 01:45:36,351 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 01:45:36,363 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 01:45:36,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:36,364 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:36,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746301270] [2022-11-03 01:45:36,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746301270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:36,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:36,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:36,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112758577] [2022-11-03 01:45:36,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:36,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:45:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:45:36,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:45:36,366 INFO L87 Difference]: Start difference. First operand 5369 states and 7913 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 01:45:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:42,300 INFO L93 Difference]: Finished difference Result 5368 states and 7910 transitions. [2022-11-03 01:45:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:45:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-03 01:45:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:42,306 INFO L225 Difference]: With dead ends: 5368 [2022-11-03 01:45:42,306 INFO L226 Difference]: Without dead ends: 5368 [2022-11-03 01:45:42,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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 01:45:42,313 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 4 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5570 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:42,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5570 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-03 01:45:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2022-11-03 01:45:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5368. [2022-11-03 01:45:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 4485 states have (on average 1.7431438127090302) internal successors, (7818), 5322 states have internal predecessors, (7818), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 01:45:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7910 transitions. [2022-11-03 01:45:42,364 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7910 transitions. Word has length 67 [2022-11-03 01:45:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:42,365 INFO L495 AbstractCegarLoop]: Abstraction has 5368 states and 7910 transitions. [2022-11-03 01:45:42,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 01:45:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7910 transitions. [2022-11-03 01:45:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 01:45:42,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:42,366 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 01:45:42,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:42,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:42,571 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:42,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-11-03 01:45:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:42,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874759740] [2022-11-03 01:45:42,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:42,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:42,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:42,573 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:42,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-03 01:45:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:43,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:45:43,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:43,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:45:43,043 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 01:45:43,053 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 01:45:43,103 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 01:45:43,110 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 01:45:43,127 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 01:45:43,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:43,128 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:43,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874759740] [2022-11-03 01:45:43,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874759740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:43,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:43,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:43,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815426519] [2022-11-03 01:45:43,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:43,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:45:43,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:43,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:45:43,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:45:43,131 INFO L87 Difference]: Start difference. First operand 5368 states and 7910 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 01:45:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:51,211 INFO L93 Difference]: Finished difference Result 5367 states and 7907 transitions. [2022-11-03 01:45:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:45:51,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-03 01:45:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:51,218 INFO L225 Difference]: With dead ends: 5367 [2022-11-03 01:45:51,218 INFO L226 Difference]: Without dead ends: 5367 [2022-11-03 01:45:51,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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 01:45:51,219 INFO L413 NwaCegarLoop]: 2112 mSDtfsCounter, 2 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5571 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:51,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5571 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-11-03 01:45:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2022-11-03 01:45:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 5367. [2022-11-03 01:45:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5367 states, 4482 states have (on average 1.7436412315930387) internal successors, (7815), 5321 states have internal predecessors, (7815), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 01:45:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 7907 transitions. [2022-11-03 01:45:51,274 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 7907 transitions. Word has length 67 [2022-11-03 01:45:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:51,274 INFO L495 AbstractCegarLoop]: Abstraction has 5367 states and 7907 transitions. [2022-11-03 01:45:51,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 01:45:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 7907 transitions. [2022-11-03 01:45:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 01:45:51,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:51,276 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 01:45:51,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-11-03 01:45:51,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:51,492 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2022-11-03 01:45:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:51,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421876136] [2022-11-03 01:45:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:51,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:51,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:51,494 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:51,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-03 01:45:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:51,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:45:51,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:51,987 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 01:45:52,001 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 01:45:52,027 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 01:45:52,037 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 01:45:52,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:52,037 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:52,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421876136] [2022-11-03 01:45:52,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421876136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:52,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:52,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:52,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319158857] [2022-11-03 01:45:52,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:52,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:45:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:52,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:45:52,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:45:52,039 INFO L87 Difference]: Start difference. First operand 5367 states and 7907 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 01:45:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:58,177 INFO L93 Difference]: Finished difference Result 5366 states and 7903 transitions. [2022-11-03 01:45:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:45:58,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-03 01:45:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:58,182 INFO L225 Difference]: With dead ends: 5366 [2022-11-03 01:45:58,182 INFO L226 Difference]: Without dead ends: 5366 [2022-11-03 01:45:58,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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 01:45:58,183 INFO L413 NwaCegarLoop]: 2110 mSDtfsCounter, 4 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5565 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:58,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5565 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-03 01:45:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5366 states. [2022-11-03 01:45:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5366 to 5366. [2022-11-03 01:45:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5366 states, 4482 states have (on average 1.7427487728692548) internal successors, (7811), 5320 states have internal predecessors, (7811), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 01:45:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5366 states to 5366 states and 7903 transitions. [2022-11-03 01:45:58,232 INFO L78 Accepts]: Start accepts. Automaton has 5366 states and 7903 transitions. Word has length 67 [2022-11-03 01:45:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:58,232 INFO L495 AbstractCegarLoop]: Abstraction has 5366 states and 7903 transitions. [2022-11-03 01:45:58,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 01:45:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5366 states and 7903 transitions. [2022-11-03 01:45:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 01:45:58,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:58,233 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 01:45:58,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:58,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:45:58,443 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:45:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2022-11-03 01:45:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:58,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952764767] [2022-11-03 01:45:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:58,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:58,445 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:58,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-03 01:45:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:58,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:45:58,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:58,874 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 01:45:58,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 01:45:58,922 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 01:45:58,977 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 01:45:58,981 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 01:45:59,003 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 01:45:59,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:59,003 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:59,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952764767] [2022-11-03 01:45:59,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952764767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:59,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:59,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653961353] [2022-11-03 01:45:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:59,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:45:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:45:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:45:59,005 INFO L87 Difference]: Start difference. First operand 5366 states and 7903 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 01:46:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:08,081 INFO L93 Difference]: Finished difference Result 5365 states and 7899 transitions. [2022-11-03 01:46:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:46:08,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-03 01:46:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:08,088 INFO L225 Difference]: With dead ends: 5365 [2022-11-03 01:46:08,088 INFO L226 Difference]: Without dead ends: 5365 [2022-11-03 01:46:08,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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 01:46:08,089 INFO L413 NwaCegarLoop]: 2110 mSDtfsCounter, 2 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5566 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:08,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5566 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-11-03 01:46:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2022-11-03 01:46:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 5365. [2022-11-03 01:46:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4478 states have (on average 1.7434122376060741) internal successors, (7807), 5319 states have internal predecessors, (7807), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 01:46:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 7899 transitions. [2022-11-03 01:46:08,146 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 7899 transitions. Word has length 67 [2022-11-03 01:46:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:08,147 INFO L495 AbstractCegarLoop]: Abstraction has 5365 states and 7899 transitions. [2022-11-03 01:46:08,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 01:46:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 7899 transitions. [2022-11-03 01:46:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-03 01:46:08,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:08,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:08,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-11-03 01:46:08,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:46:08,365 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:46:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1243544783, now seen corresponding path program 1 times [2022-11-03 01:46:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:46:08,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878191767] [2022-11-03 01:46:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:08,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:46:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:46:08,368 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:46:08,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-03 01:46:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:08,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:46:08,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:08,837 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 01:46:08,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:46:08,838 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:46:08,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878191767] [2022-11-03 01:46:08,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878191767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:08,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:46:08,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:46:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846059490] [2022-11-03 01:46:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:08,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:46:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:46:08,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:46:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:46:08,841 INFO L87 Difference]: Start difference. First operand 5365 states and 7899 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 01:46:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:08,931 INFO L93 Difference]: Finished difference Result 5368 states and 7908 transitions. [2022-11-03 01:46:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:46:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2022-11-03 01:46:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:08,976 INFO L225 Difference]: With dead ends: 5368 [2022-11-03 01:46:08,986 INFO L226 Difference]: Without dead ends: 5368 [2022-11-03 01:46:08,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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 01:46:08,988 INFO L413 NwaCegarLoop]: 2109 mSDtfsCounter, 2 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6319 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 01:46:08,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6319 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:46:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2022-11-03 01:46:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5368. [2022-11-03 01:46:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 4480 states have (on average 1.7433035714285714) internal successors, (7810), 5322 states have internal predecessors, (7810), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 01:46:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7908 transitions. [2022-11-03 01:46:09,082 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7908 transitions. Word has length 75 [2022-11-03 01:46:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:09,083 INFO L495 AbstractCegarLoop]: Abstraction has 5368 states and 7908 transitions. [2022-11-03 01:46:09,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 01:46:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7908 transitions. [2022-11-03 01:46:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-03 01:46:09,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:09,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:09,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:09,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:46:09,302 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:46:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1194961360, now seen corresponding path program 1 times [2022-11-03 01:46:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:46:09,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423663200] [2022-11-03 01:46:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:09,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:46:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:46:09,304 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:46:09,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-03 01:46:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:09,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:46:09,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:09,767 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 01:46:09,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:09,876 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 01:46:09,876 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:46:09,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423663200] [2022-11-03 01:46:09,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423663200] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:09,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2040528256] [2022-11-03 01:46:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:09,877 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:46:09,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:46:09,884 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:46:09,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-03 01:46:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:10,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:46:10,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:10,647 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 01:46:10,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:10,695 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 01:46:10,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2040528256] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:10,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133654772] [2022-11-03 01:46:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:10,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:10,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:10,704 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:10,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 01:46:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:11,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:46:11,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:11,242 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 01:46:11,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:11,290 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 01:46:11,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133654772] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:11,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:46:11,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-03 01:46:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092081994] [2022-11-03 01:46:11,291 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:11,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:46:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:46:11,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:46:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:46:11,292 INFO L87 Difference]: Start difference. First operand 5368 states and 7908 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 01:46:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:11,595 INFO L93 Difference]: Finished difference Result 5380 states and 7930 transitions. [2022-11-03 01:46:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:46:11,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-11-03 01:46:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:11,607 INFO L225 Difference]: With dead ends: 5380 [2022-11-03 01:46:11,608 INFO L226 Difference]: Without dead ends: 5380 [2022-11-03 01:46:11,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 444 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 01:46:11,609 INFO L413 NwaCegarLoop]: 2109 mSDtfsCounter, 12 mSDsluCounter, 12611 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14720 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:11,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14720 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:46:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2022-11-03 01:46:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 5378. [2022-11-03 01:46:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5378 states, 4489 states have (on average 1.7431499220316329) internal successors, (7825), 5331 states have internal predecessors, (7825), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 01:46:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 7923 transitions. [2022-11-03 01:46:11,685 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 7923 transitions. Word has length 76 [2022-11-03 01:46:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:11,685 INFO L495 AbstractCegarLoop]: Abstraction has 5378 states and 7923 transitions. [2022-11-03 01:46:11,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 01:46:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 7923 transitions. [2022-11-03 01:46:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-03 01:46:11,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:11,687 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:11,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:11,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:12,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:12,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:12,295 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:46:12,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1708838159, now seen corresponding path program 2 times [2022-11-03 01:46:12,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:46:12,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784628318] [2022-11-03 01:46:12,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:46:12,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:46:12,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:46:12,298 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:46:12,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-03 01:46:12,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:46:12,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:12,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:46:12,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:13,068 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 01:46:13,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:13,307 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 01:46:13,308 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:46:13,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784628318] [2022-11-03 01:46:13,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784628318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:13,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1777939856] [2022-11-03 01:46:13,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:46:13,308 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:46:13,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:46:13,311 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:46:13,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-03 01:46:15,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:46:15,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:15,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:46:15,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:15,544 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 01:46:15,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:15,629 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 01:46:15,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1777939856] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:15,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097308732] [2022-11-03 01:46:15,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:46:15,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:15,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:15,631 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:15,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 01:46:47,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:46:47,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:47,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 01:46:47,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:47,454 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:46:47,455 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 01:46:47,488 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 01:46:47,974 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:46:47,975 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 01:46:48,096 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 01:46:48,138 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 01:46:48,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:48,280 INFO L356 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-03 01:46:48,280 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 01:46:48,290 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2339) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2022-11-03 01:46:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097308732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:48,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 01:46:48,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-11-03 01:46:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182864291] [2022-11-03 01:46:48,293 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 01:46:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:46:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 01:46:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=513, Unknown=2, NotChecked=46, Total=650 [2022-11-03 01:46:48,295 INFO L87 Difference]: Start difference. First operand 5378 states and 7923 transitions. Second operand has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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 01:47:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:20,479 INFO L93 Difference]: Finished difference Result 14097 states and 21664 transitions. [2022-11-03 01:47:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 01:47:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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 79 [2022-11-03 01:47:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:20,507 INFO L225 Difference]: With dead ends: 14097 [2022-11-03 01:47:20,507 INFO L226 Difference]: Without dead ends: 14097 [2022-11-03 01:47:20,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 368 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 01:47:20,509 INFO L413 NwaCegarLoop]: 2250 mSDtfsCounter, 3986 mSDsluCounter, 26039 mSDsCounter, 0 mSdLazyCounter, 17835 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4000 SdHoareTripleChecker+Valid, 28289 SdHoareTripleChecker+Invalid, 18970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 17835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1057 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:20,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4000 Valid, 28289 Invalid, 18970 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [78 Valid, 17835 Invalid, 0 Unknown, 1057 Unchecked, 30.6s Time] [2022-11-03 01:47:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14097 states. [2022-11-03 01:47:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14097 to 5384. [2022-11-03 01:47:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5384 states, 4495 states have (on average 1.742602892102336) internal successors, (7833), 5337 states have internal predecessors, (7833), 46 states have call successors, (46), 4 states have call predecessors, (46), 6 states have return successors, (56), 43 states have call predecessors, (56), 46 states have call successors, (56) [2022-11-03 01:47:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 7935 transitions. [2022-11-03 01:47:20,617 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 7935 transitions. Word has length 79 [2022-11-03 01:47:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:20,617 INFO L495 AbstractCegarLoop]: Abstraction has 5384 states and 7935 transitions. [2022-11-03 01:47:20,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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 01:47:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 7935 transitions. [2022-11-03 01:47:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-03 01:47:20,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:20,619 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:20,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:20,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-11-03 01:47:21,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:21,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:21,235 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:47:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1987898053, now seen corresponding path program 1 times [2022-11-03 01:47:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:47:21,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243238498] [2022-11-03 01:47:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:21,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:47:21,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:47:21,237 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:47:21,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-03 01:47:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:21,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:47:21,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:21,779 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 01:47:21,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:22,041 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 01:47:22,041 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:47:22,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243238498] [2022-11-03 01:47:22,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243238498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:22,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [506633379] [2022-11-03 01:47:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:22,042 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:47:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:47:22,047 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:47:22,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-03 01:47:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:22,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:47:22,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:22,884 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 01:47:22,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:22,969 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 01:47:22,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [506633379] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:22,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987620415] [2022-11-03 01:47:22,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:22,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:22,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:22,971 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:22,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 01:47:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:23,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:47:23,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:23,486 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 01:47:23,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:23,762 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 01:47:23,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987620415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:23,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:47:23,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 20 [2022-11-03 01:47:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151570344] [2022-11-03 01:47:23,763 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:47:23,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:47:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:47:23,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:47:23,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2022-11-03 01:47:23,765 INFO L87 Difference]: Start difference. First operand 5384 states and 7935 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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 01:47:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:24,935 INFO L93 Difference]: Finished difference Result 5400 states and 7963 transitions. [2022-11-03 01:47:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 01:47:24,936 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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 79 [2022-11-03 01:47:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:24,947 INFO L225 Difference]: With dead ends: 5400 [2022-11-03 01:47:24,947 INFO L226 Difference]: Without dead ends: 5392 [2022-11-03 01:47:24,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=416, Invalid=774, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 01:47:24,948 INFO L413 NwaCegarLoop]: 2109 mSDtfsCounter, 81 mSDsluCounter, 10532 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 12641 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:24,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 12641 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:47:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5392 states. [2022-11-03 01:47:24,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5392 to 5386. [2022-11-03 01:47:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5386 states, 4498 states have (on average 1.741440640284571) internal successors, (7833), 5339 states have internal predecessors, (7833), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 01:47:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5386 states to 5386 states and 7931 transitions. [2022-11-03 01:47:25,013 INFO L78 Accepts]: Start accepts. Automaton has 5386 states and 7931 transitions. Word has length 79 [2022-11-03 01:47:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:25,013 INFO L495 AbstractCegarLoop]: Abstraction has 5386 states and 7931 transitions. [2022-11-03 01:47:25,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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 01:47:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5386 states and 7931 transitions. [2022-11-03 01:47:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-03 01:47:25,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:25,015 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:25,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:25,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2022-11-03 01:47:25,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:25,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:25,629 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:47:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1472099984, now seen corresponding path program 1 times [2022-11-03 01:47:25,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:47:25,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209117276] [2022-11-03 01:47:25,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:25,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:47:25,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:47:25,631 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:47:25,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-03 01:47:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:26,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 01:47:26,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:26,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:26,981 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:47:26,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209117276] [2022-11-03 01:47:26,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209117276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:26,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [88001705] [2022-11-03 01:47:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:26,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:47:26,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:47:26,987 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:47:27,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-03 01:47:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:27,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 01:47:27,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:27,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:28,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [88001705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:28,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852716527] [2022-11-03 01:47:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:47:28,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:28,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:28,123 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:28,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 01:47:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:47:28,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:47:28,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:28,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:29,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852716527] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:29,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:47:29,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-03 01:47:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089021894] [2022-11-03 01:47:29,728 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:47:29,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 01:47:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:47:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 01:47:29,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 01:47:29,729 INFO L87 Difference]: Start difference. First operand 5386 states and 7931 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 01:47:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:34,102 INFO L93 Difference]: Finished difference Result 5426 states and 8026 transitions. [2022-11-03 01:47:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-03 01:47:34,104 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 85 [2022-11-03 01:47:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:34,114 INFO L225 Difference]: With dead ends: 5426 [2022-11-03 01:47:34,114 INFO L226 Difference]: Without dead ends: 5420 [2022-11-03 01:47:34,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1590, Invalid=3240, Unknown=0, NotChecked=0, Total=4830 [2022-11-03 01:47:34,116 INFO L413 NwaCegarLoop]: 2114 mSDtfsCounter, 186 mSDsluCounter, 25308 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 27422 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:34,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 27422 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 01:47:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2022-11-03 01:47:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 5404. [2022-11-03 01:47:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 4516 states have (on average 1.7395925597874224) internal successors, (7856), 5357 states have internal predecessors, (7856), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 01:47:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 7954 transitions. [2022-11-03 01:47:34,185 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 7954 transitions. Word has length 85 [2022-11-03 01:47:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:34,186 INFO L495 AbstractCegarLoop]: Abstraction has 5404 states and 7954 transitions. [2022-11-03 01:47:34,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 01:47:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 7954 transitions. [2022-11-03 01:47:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-03 01:47:34,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:47:34,188 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:34,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:34,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:34,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:34,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:47:34,806 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:47:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:47:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1934666288, now seen corresponding path program 2 times [2022-11-03 01:47:34,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:47:34,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313595643] [2022-11-03 01:47:34,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:47:34,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:47:34,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:47:34,809 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:47:34,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-03 01:47:35,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:47:35,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:47:35,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 01:47:35,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:36,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:38,313 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:47:38,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313595643] [2022-11-03 01:47:38,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313595643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:38,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1536418239] [2022-11-03 01:47:38,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:47:38,314 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:47:38,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:47:38,315 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:47:38,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-03 01:47:40,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:47:40,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:47:40,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 01:47:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:47:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:40,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:47:41,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1536418239] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:47:41,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456066172] [2022-11-03 01:47:41,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:47:41,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:47:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:47:41,152 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:47:41,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-03 01:48:18,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:48:18,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:48:18,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-03 01:48:18,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:18,592 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 01:48:18,605 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:48:18,605 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 01:48:18,725 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 01:48:18,735 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 01:48:19,104 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 01:48:19,110 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 01:48:19,753 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3945))) (exists ((v_ArrVal_3944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3944)))) is different from true [2022-11-03 01:48:19,911 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948))) (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949)))) is different from true [2022-11-03 01:48:19,926 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950)))) is different from true [2022-11-03 01:48:19,942 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3952))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3953)))) is different from true [2022-11-03 01:48:19,972 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3955))) (exists ((v_ArrVal_3954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3954) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:48:20,133 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3959))) (exists ((v_ArrVal_3958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3958) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:48:20,283 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3962))) (exists ((v_ArrVal_3963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3963) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:48:20,295 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965)))) is different from true [2022-11-03 01:48:20,310 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966))) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32)))) is different from true [2022-11-03 01:48:20,465 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:48:20,480 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973))) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972)))) is different from true [2022-11-03 01:48:20,933 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980))) (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981)))) is different from true [2022-11-03 01:48:20,987 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:20,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 46 treesize of output 45 [2022-11-03 01:48:21,001 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 01:48:21,186 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 01:48:21,196 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 01:48:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 198 not checked. [2022-11-03 01:48:21,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:48:22,214 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4028 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_4029 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4028 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-03 01:48:22,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456066172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:48:22,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 01:48:22,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 21] total 70 [2022-11-03 01:48:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975187732] [2022-11-03 01:48:22,224 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 01:48:22,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-03 01:48:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:48:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-03 01:48:22,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2828, Unknown=42, NotChecked=1664, Total=5256 [2022-11-03 01:48:22,227 INFO L87 Difference]: Start difference. First operand 5404 states and 7954 transitions. Second operand has 70 states, 69 states have (on average 2.8260869565217392) internal successors, (195), 70 states have internal predecessors, (195), 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 01:48:26,174 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980))) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981)))) is different from true [2022-11-03 01:49:08,001 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3966))) (exists ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3967) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3952))) (exists ((v_arrayElimCell_25 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_25) (_ bv44 32))) (exists ((v_ArrVal_3980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3980))) (exists ((v_ArrVal_3939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3939) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3965))) (exists ((v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3948))) (exists ((v_ArrVal_3945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3945))) (exists ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3950))) (exists ((v_ArrVal_3962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3962))) (exists ((v_ArrVal_3955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3955))) (exists ((v_ArrVal_3971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3959))) (exists ((v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3949))) (exists ((v_ArrVal_3954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3973))) (exists ((v_ArrVal_3938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3938))) (exists ((v_ArrVal_3944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3944))) (exists ((v_ArrVal_3972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3972))) (exists ((v_ArrVal_3958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3953))) (exists ((v_ArrVal_3963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3963) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3970 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3970) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3981)))) is different from true [2022-11-03 01:50:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:25,610 INFO L93 Difference]: Finished difference Result 14216 states and 21806 transitions. [2022-11-03 01:50:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-11-03 01:50:25,610 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.8260869565217392) internal successors, (195), 70 states have internal predecessors, (195), 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 97 [2022-11-03 01:50:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:25,636 INFO L225 Difference]: With dead ends: 14216 [2022-11-03 01:50:25,636 INFO L226 Difference]: Without dead ends: 14206 [2022-11-03 01:50:25,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 404 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 3668 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=4060, Invalid=13015, Unknown=277, NotChecked=4110, Total=21462 [2022-11-03 01:50:25,641 INFO L413 NwaCegarLoop]: 2172 mSDtfsCounter, 4102 mSDsluCounter, 62920 mSDsCounter, 0 mSdLazyCounter, 44846 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4119 SdHoareTripleChecker+Valid, 65092 SdHoareTripleChecker+Invalid, 92784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 44846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47811 IncrementalHoareTripleChecker+Unchecked, 78.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:25,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4119 Valid, 65092 Invalid, 92784 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [127 Valid, 44846 Invalid, 0 Unknown, 47811 Unchecked, 78.7s Time] [2022-11-03 01:50:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14206 states. [2022-11-03 01:50:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14206 to 5486. [2022-11-03 01:50:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5486 states, 4598 states have (on average 1.7290126141800783) internal successors, (7950), 5438 states have internal predecessors, (7950), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-11-03 01:50:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 8048 transitions. [2022-11-03 01:50:25,767 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 8048 transitions. Word has length 97 [2022-11-03 01:50:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:25,767 INFO L495 AbstractCegarLoop]: Abstraction has 5486 states and 8048 transitions. [2022-11-03 01:50:25,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.8260869565217392) internal successors, (195), 70 states have internal predecessors, (195), 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 01:50:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 8048 transitions. [2022-11-03 01:50:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-03 01:50:25,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:25,771 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:25,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:26,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:26,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:26,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:26,393 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:50:26,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1938990661, now seen corresponding path program 2 times [2022-11-03 01:50:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:50:26,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758480789] [2022-11-03 01:50:26,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:50:26,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:50:26,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:50:26,396 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:50:26,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-03 01:50:27,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-03 01:50:27,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:50:27,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 01:50:27,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:27,054 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 01:50:27,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:50:27,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:50:27,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:50:27,071 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 30 treesize of output 39 [2022-11-03 01:50:27,161 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:50:27,162 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 01:50:27,259 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 45 treesize of output 41 [2022-11-03 01:50:27,368 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 45 treesize of output 41 [2022-11-03 01:50:27,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:27,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-03 01:50:27,492 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 01:50:27,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:50:27,493 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:50:27,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758480789] [2022-11-03 01:50:27,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758480789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:27,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:27,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:50:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629925766] [2022-11-03 01:50:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:27,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:50:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:50:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:50:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:50:27,495 INFO L87 Difference]: Start difference. First operand 5486 states and 8048 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 01:50:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:35,938 INFO L93 Difference]: Finished difference Result 5667 states and 7979 transitions. [2022-11-03 01:50:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:50:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 119 [2022-11-03 01:50:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:35,949 INFO L225 Difference]: With dead ends: 5667 [2022-11-03 01:50:35,949 INFO L226 Difference]: Without dead ends: 5667 [2022-11-03 01:50:35,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:50:35,950 INFO L413 NwaCegarLoop]: 1415 mSDtfsCounter, 2046 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2056 SdHoareTripleChecker+Valid, 4656 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:35,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2056 Valid, 4656 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3187 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-11-03 01:50:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5667 states. [2022-11-03 01:50:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5667 to 5085. [2022-11-03 01:50:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5085 states, 4198 states have (on average 1.7527393997141496) internal successors, (7358), 5040 states have internal predecessors, (7358), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-03 01:50:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5085 states to 5085 states and 7449 transitions. [2022-11-03 01:50:36,009 INFO L78 Accepts]: Start accepts. Automaton has 5085 states and 7449 transitions. Word has length 119 [2022-11-03 01:50:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:36,010 INFO L495 AbstractCegarLoop]: Abstraction has 5085 states and 7449 transitions. [2022-11-03 01:50:36,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 01:50:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5085 states and 7449 transitions. [2022-11-03 01:50:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-03 01:50:36,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:36,012 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:36,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:36,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:50:36,230 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:50:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:36,230 INFO L85 PathProgramCache]: Analyzing trace with hash -961839399, now seen corresponding path program 1 times [2022-11-03 01:50:36,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:50:36,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183600549] [2022-11-03 01:50:36,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:36,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:50:36,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:50:36,233 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:50:36,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-03 01:50:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:37,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 01:50:37,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:37,469 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 01:50:37,617 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:50:37,617 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 01:50:37,643 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 01:50:37,743 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 01:50:38,848 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_41 (_ BitVec 32))) (and (not (= v_arrayElimCell_41 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (bvadd (select |c_#valid| v_arrayElimCell_41) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (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)))) is different from true [2022-11-03 01:50:39,755 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:39,755 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 01:50:39,888 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:39,888 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 01:50:39,915 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 01:50:39,953 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 01:50:39,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:40,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-03 01:50:40,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4876))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4830)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-03 01:50:40,395 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:50:40,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183600549] [2022-11-03 01:50:40,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183600549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:40,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [417828918] [2022-11-03 01:50:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:40,396 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:50:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:50:40,399 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:50:40,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-03 01:50:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:44,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-03 01:50:44,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:44,730 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 01:50:44,865 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:50:44,865 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 01:50:44,888 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 01:50:44,948 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 01:50:46,855 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:46,855 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 01:50:46,932 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:46,933 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 01:50:46,958 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 01:50:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-03 01:50:46,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:46,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5300) |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 01:50:46,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (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_5300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-11-03 01:50:47,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5346 (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~mem39#1.base| v_ArrVal_5346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-03 01:50:47,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [417828918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:47,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816317634] [2022-11-03 01:50:47,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:47,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:47,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:47,285 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:47,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-03 01:50:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:48,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:50:48,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:48,205 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 6 treesize of output 5 [2022-11-03 01:50:48,303 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-03 01:50:48,303 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 39 treesize of output 29 [2022-11-03 01:50:48,408 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 01:50:48,408 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 38 treesize of output 17 [2022-11-03 01:50:48,438 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 01:50:48,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:50:48,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816317634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:48,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:50:48,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 14 [2022-11-03 01:50:48,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630464219] [2022-11-03 01:50:48,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:48,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:50:48,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:50:48,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:50:48,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=175, Unknown=20, NotChecked=198, Total=462 [2022-11-03 01:50:48,440 INFO L87 Difference]: Start difference. First operand 5085 states and 7449 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 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 01:50:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:53,506 INFO L93 Difference]: Finished difference Result 5086 states and 7447 transitions. [2022-11-03 01:50:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:50:53,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 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 122 [2022-11-03 01:50:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:53,515 INFO L225 Difference]: With dead ends: 5086 [2022-11-03 01:50:53,515 INFO L226 Difference]: Without dead ends: 5084 [2022-11-03 01:50:53,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 266 SyntacticMatches, 91 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=76, Invalid=199, Unknown=21, NotChecked=210, Total=506 [2022-11-03 01:50:53,516 INFO L413 NwaCegarLoop]: 2100 mSDtfsCounter, 12 mSDsluCounter, 4591 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6691 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1913 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:53,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6691 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1920 Invalid, 0 Unknown, 1913 Unchecked, 4.9s Time] [2022-11-03 01:50:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2022-11-03 01:50:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 5084. [2022-11-03 01:50:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5084 states, 4198 states have (on average 1.7515483563601715) internal successors, (7353), 5039 states have internal predecessors, (7353), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-03 01:50:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5084 states to 5084 states and 7444 transitions. [2022-11-03 01:50:53,609 INFO L78 Accepts]: Start accepts. Automaton has 5084 states and 7444 transitions. Word has length 122 [2022-11-03 01:50:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:53,610 INFO L495 AbstractCegarLoop]: Abstraction has 5084 states and 7444 transitions. [2022-11-03 01:50:53,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 7 states have internal predecessors, (77), 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 01:50:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 7444 transitions. [2022-11-03 01:50:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-03 01:50:53,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:53,612 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:53,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:53,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:54,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:54,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:50:54,228 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:50:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash -961839398, now seen corresponding path program 1 times [2022-11-03 01:50:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:50:54,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091011472] [2022-11-03 01:50:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:54,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:50:54,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:50:54,231 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:50:54,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-03 01:50:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:55,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-03 01:50:55,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:55,382 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 01:50:55,498 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 01:50:55,510 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:50:55,511 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 01:50:55,535 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 01:50:55,545 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 01:50:55,690 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 01:50:55,695 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 01:50:55,794 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6108))) (exists ((v_ArrVal_6109 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6109))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:55,805 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6110))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6111) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:50:55,849 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6114))) (exists ((v_ArrVal_6115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6115) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:55,861 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6116))) (exists ((v_ArrVal_6117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6117))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:55,879 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6119) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:55,891 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6121))) (exists ((v_ArrVal_6120 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6120))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:55,942 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6124 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6124))) (exists ((v_ArrVal_6125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6125) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:55,955 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6127 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6127) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6126))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:56,190 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6142))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:56,296 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6151) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6150)))) is different from true [2022-11-03 01:50:56,308 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6153))) (exists ((v_ArrVal_6152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6152))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:56,320 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6155))) (exists ((v_ArrVal_6154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6154) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:56,395 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6160) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6161)))) is different from true [2022-11-03 01:50:56,406 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6163) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6162) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:56,417 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6165))) (exists ((v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6164)))) is different from true [2022-11-03 01:50:56,429 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6167))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6166 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6166)))) is different from true [2022-11-03 01:50:56,444 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6168 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6168))) (exists ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6169) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:56,456 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6170))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6171)))) is different from true [2022-11-03 01:50:56,468 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6173) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6172))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:56,512 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6176))) (exists ((v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6177) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:50:56,818 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:56,818 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 01:50:56,824 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 01:50:56,947 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:56,948 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 01:50:56,954 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 01:50:57,012 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 01:50:57,020 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 01:50:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 690 not checked. [2022-11-03 01:50:57,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:57,242 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6195) |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~mem41#1.base| v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6195) |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 01:50:57,281 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_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-03 01:50:58,205 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6287) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6287 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6286))) (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~mem39#1.base| v_ArrVal_6287) .cse2 v_ArrVal_6195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-03 01:50:58,216 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:50:58,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091011472] [2022-11-03 01:50:58,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091011472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:58,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [737363250] [2022-11-03 01:50:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:58,217 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:50:58,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:50:58,218 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:50:58,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-11-03 01:51:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:02,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-03 01:51:02,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:02,703 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 01:51:02,710 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 01:51:03,229 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:51:03,229 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 01:51:03,239 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 01:51:03,311 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 01:51:03,320 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 01:51:03,431 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 01:51:03,503 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 7 treesize of output 3 [2022-11-03 01:51:03,822 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6673) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:03,910 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6675) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:03,921 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6676 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6676))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:03,933 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6677) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:04,101 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6680 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6680) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,338 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6684 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6684))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,362 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6685 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6685) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,375 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6686 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6686))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,387 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6687 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6687))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,405 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6688 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6688) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,432 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6689 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6689)))) is different from true [2022-11-03 01:51:04,446 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6690 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6690))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,460 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6691 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6691) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,473 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6692)))) is different from true [2022-11-03 01:51:04,566 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6694) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,579 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6695) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,749 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6698 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6698))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,760 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6699))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,771 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6700))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,783 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6701) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,795 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6702 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6702) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:04,806 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6703 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6703)))) is different from true [2022-11-03 01:51:05,060 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6707) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:05,074 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6708) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:05,171 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6710))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:05,183 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6711)))) is different from true [2022-11-03 01:51:05,194 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6712))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:05,214 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6713))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-03 01:51:05,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:05,255 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 01:51:05,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:05,498 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 82 treesize of output 60 [2022-11-03 01:51:05,517 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-03 01:51:05,518 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 60 treesize of output 44 [2022-11-03 01:51:05,661 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 15 [2022-11-03 01:51:05,665 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 26 treesize of output 14 [2022-11-03 01:51:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-11-03 01:51:05,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:06,164 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 231 treesize of output 159 [2022-11-03 01:51:15,900 WARN L234 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 64 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:51:16,317 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6763))) (let ((.cse1 (select |c_#length| v_arrayElimCell_74)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd (_ bv20 32) .cse0) .cse1)) (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv8 32) (select (select (store .cse3 v_arrayElimCell_74 (store (select .cse3 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse0) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (or (bvule .cse2 .cse1) (forall ((v_ArrVal_6717 (_ BitVec 32))) (bvule .cse2 (select |c_#length| v_ArrVal_6717)))))))))) (forall ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6763))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (bvule (bvadd (_ bv20 32) .cse5) (select |c_#length| v_arrayElimCell_74))) (forall ((v_ArrVal_6716 (_ BitVec 32))) (let ((.cse6 (select (select (store .cse7 v_arrayElimCell_74 (store (select .cse7 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse5) v_ArrVal_6716)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse6) (bvadd (_ bv8 32) .cse6)))))))))) is different from false [2022-11-03 01:51:16,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [737363250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:16,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299607271] [2022-11-03 01:51:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:16,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:16,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:16,334 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:16,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-03 01:51:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:17,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-03 01:51:17,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:17,380 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:51:17,381 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 01:51:17,389 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 01:51:17,402 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 01:51:17,412 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 01:51:17,494 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 01:51:17,500 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 01:51:17,564 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:17,622 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7148))) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:17,638 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150))) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:17,654 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152)))) is different from true [2022-11-03 01:51:17,670 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154)))) is different from true [2022-11-03 01:51:17,686 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157))) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:17,791 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163)))) is different from true [2022-11-03 01:51:17,805 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:17,857 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169)))) is different from true [2022-11-03 01:51:17,873 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:17,962 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:18,013 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:18,030 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:18,044 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:18,129 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7191) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:18,249 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199)))) is different from true [2022-11-03 01:51:18,263 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201))) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:18,351 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:18,441 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7212) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213)))) is different from true [2022-11-03 01:51:18,454 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7215))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7214)))) is different from true [2022-11-03 01:51:18,468 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7217))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7216)))) is different from true [2022-11-03 01:51:18,481 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7219) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7218) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:18,531 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222))) (exists ((v_ArrVal_7223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7223))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:18,600 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227))) (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:18,616 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7228))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32)))) is different from true [2022-11-03 01:51:18,633 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7231))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7230) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:51:18,684 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:51:18,685 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 01:51:18,695 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 01:51:18,782 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:51:18,783 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 01:51:18,794 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 01:51:18,827 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 01:51:18,835 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 01:51:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2022-11-03 01:51:18,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:18,926 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7233) |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 01:51:18,973 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-03 01:51:19,909 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7324))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7325) .cse0 v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7325) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-11-03 01:51:19,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299607271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:19,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:19,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39, 36] total 94 [2022-11-03 01:51:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281502649] [2022-11-03 01:51:19,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:19,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-11-03 01:51:19,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:51:19,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-11-03 01:51:19,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=582, Unknown=109, NotChecked=10206, Total=11130 [2022-11-03 01:51:19,920 INFO L87 Difference]: Start difference. First operand 5084 states and 7444 transitions. Second operand has 95 states, 92 states have (on average 3.097826086956522) internal successors, (285), 95 states have internal predecessors, (285), 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 01:51:21,163 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6673) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6710))) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7222 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7222))) (exists ((v_ArrVal_7227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7227))) (exists ((v_ArrVal_6114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6114))) (exists ((v_ArrVal_6143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6694) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6108))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_7223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7223))) (exists ((v_ArrVal_6115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6115) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6675) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6151) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7177))) (exists ((v_ArrVal_6142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6142))) (exists ((v_ArrVal_6684 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6684))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181))) (exists ((v_ArrVal_7226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7226))) (exists ((v_ArrVal_6124 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6124))) (exists ((v_ArrVal_6125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7180))) (exists ((v_ArrVal_7206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7206) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6176))) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198))) (exists ((v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7148))) (exists ((v_ArrVal_6670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6670))) (exists ((v_ArrVal_6680 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6680) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6707) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190))) (exists ((v_ArrVal_6109 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6109))) (exists ((v_ArrVal_7212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7212) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199))) (exists ((v_ArrVal_6160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6160) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6107))) (exists ((v_ArrVal_6698 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6698))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6161))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169))) (exists ((v_ArrVal_6150 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6150))) (exists ((v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7213))) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163))) (exists ((v_ArrVal_6106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6106) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7191) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:51:21,403 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|) (_ bv72 32))) (exists ((v_ArrVal_6670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6670))) (exists ((v_arrayElimCell_56 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_56) (_ bv44 32))) (exists ((v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6107))) (exists ((|v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| |v_ULTIMATE.start_main_#t~mem39#1.base_BEFORE_CALL_6|))) (exists ((v_ArrVal_6106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6106) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:08,460 INFO L93 Difference]: Finished difference Result 19371 states and 29773 transitions. [2022-11-03 01:52:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:52:08,461 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 92 states have (on average 3.097826086956522) internal successors, (285), 95 states have internal predecessors, (285), 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 122 [2022-11-03 01:52:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:08,483 INFO L225 Difference]: With dead ends: 19371 [2022-11-03 01:52:08,483 INFO L226 Difference]: Without dead ends: 19371 [2022-11-03 01:52:08,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 223 SyntacticMatches, 60 SemanticMatches, 118 ConstructedPredicates, 83 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=340, Invalid=1184, Unknown=140, NotChecked=12616, Total=14280 [2022-11-03 01:52:08,486 INFO L413 NwaCegarLoop]: 2294 mSDtfsCounter, 6362 mSDsluCounter, 26288 mSDsCounter, 0 mSdLazyCounter, 20092 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6382 SdHoareTripleChecker+Valid, 28582 SdHoareTripleChecker+Invalid, 318932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 20092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298755 IncrementalHoareTripleChecker+Unchecked, 45.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:08,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6382 Valid, 28582 Invalid, 318932 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [85 Valid, 20092 Invalid, 0 Unknown, 298755 Unchecked, 45.5s Time] [2022-11-03 01:52:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19371 states. [2022-11-03 01:52:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19371 to 5083. [2022-11-03 01:52:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5083 states, 4198 states have (on average 1.7508337303477846) internal successors, (7350), 5038 states have internal predecessors, (7350), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2022-11-03 01:52:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 7441 transitions. [2022-11-03 01:52:08,628 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 7441 transitions. Word has length 122 [2022-11-03 01:52:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:08,629 INFO L495 AbstractCegarLoop]: Abstraction has 5083 states and 7441 transitions. [2022-11-03 01:52:08,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 92 states have (on average 3.097826086956522) internal successors, (285), 95 states have internal predecessors, (285), 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 01:52:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 7441 transitions. [2022-11-03 01:52:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-03 01:52:08,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:08,630 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:08,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (51)] Ended with exit code 0 [2022-11-03 01:52:08,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (50)] Ended with exit code 0 [2022-11-03 01:52:09,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:09,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:09,243 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1190 more)] === [2022-11-03 01:52:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1864593015, now seen corresponding path program 1 times [2022-11-03 01:52:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:52:09,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710040074] [2022-11-03 01:52:09,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:09,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:52:09,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:52:09,246 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:52:09,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-11-03 01:52:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:10,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-03 01:52:10,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:10,585 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 01:52:10,745 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:52:10,745 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 01:52:10,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 01:52:10,778 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 01:52:10,790 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 01:52:10,949 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 01:52:10,954 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 01:52:11,023 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7722))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,134 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729)))) is different from true [2022-11-03 01:52:11,152 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,169 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:11,235 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737)))) is different from true [2022-11-03 01:52:11,253 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:52:11,271 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740)))) is different from true [2022-11-03 01:52:11,288 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,306 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:52:11,322 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:11,339 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,404 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752)))) is different from true [2022-11-03 01:52:11,421 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,437 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756)))) is different from true [2022-11-03 01:52:11,454 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758)))) is different from true [2022-11-03 01:52:11,470 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761)))) is different from true [2022-11-03 01:52:11,487 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:52:11,503 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:11,520 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,586 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:11,601 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773)))) is different from true [2022-11-03 01:52:11,700 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:52:11,714 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780)))) is different from true [2022-11-03 01:52:11,727 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,739 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784)))) is different from true [2022-11-03 01:52:11,752 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787)))) is different from true [2022-11-03 01:52:11,765 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788)))) is different from true [2022-11-03 01:52:11,777 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790)))) is different from true [2022-11-03 01:52:11,792 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,840 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796)))) is different from true [2022-11-03 01:52:11,853 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,865 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:52:11,878 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:52:11,890 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804)))) is different from true [2022-11-03 01:52:11,945 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:52:12,025 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:12,026 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 01:52:12,040 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 01:52:12,161 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:12,162 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 01:52:12,168 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 01:52:12,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:52:12,282 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 01:52:12,288 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 01:52:12,320 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 01:52:12,330 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 01:52:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 945 not checked. [2022-11-03 01:52:12,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:12,592 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-03 01:52:12,628 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_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-03 01:52:12,726 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7811))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7810) .cse0 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7810) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-03 01:52:12,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (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|) .cse2))) (and (forall ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7811))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7810) .cse1 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7810) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-03 01:52:15,170 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7904))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7905) .cse1 v_ArrVal_7810) (select (select (store .cse2 .cse1 v_ArrVal_7811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7812))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7904))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7811))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7905) .cse4 v_ArrVal_7810) .cse5 v_ArrVal_7812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-03 01:52:15,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:52:15,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710040074] [2022-11-03 01:52:15,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710040074] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:15,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [304391386] [2022-11-03 01:52:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:15,194 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:52:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:52:15,195 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:52:15,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2022-11-03 01:56:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:28,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-03 01:56:28,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:28,917 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 01:56:29,227 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:56:29,227 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 01:56:29,249 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 01:56:29,265 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 01:56:29,283 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 01:56:29,424 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 01:56:29,434 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 01:56:29,565 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8302) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8303) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:56:29,841 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311)))) is different from true [2022-11-03 01:56:29,868 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313)))) is different from true [2022-11-03 01:56:29,893 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8314) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8315))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:29,984 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319)))) is different from true [2022-11-03 01:56:30,077 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322)))) is different from true [2022-11-03 01:56:30,103 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:30,193 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328)))) is different from true [2022-11-03 01:56:30,283 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332)))) is different from true [2022-11-03 01:56:30,913 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352)))) is different from true [2022-11-03 01:56:30,949 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:30,974 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:30,999 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358))) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359)))) is different from true [2022-11-03 01:56:31,025 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360)))) is different from true [2022-11-03 01:56:31,118 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364)))) is different from true [2022-11-03 01:56:31,213 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:56:31,239 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371)))) is different from true [2022-11-03 01:56:31,328 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:31,354 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:31,446 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380)))) is different from true [2022-11-03 01:56:31,472 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383)))) is different from true [2022-11-03 01:56:31,564 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:56:31,719 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:31,719 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 01:56:31,730 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 01:56:31,890 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:31,891 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 01:56:31,912 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 01:56:32,010 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:32,010 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 01:56:32,025 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 01:56:32,071 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 01:56:32,083 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 01:56:32,091 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 01:56:32,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:32,185 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-03 01:56:32,235 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_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-03 01:56:32,311 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8390))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8391) .cse0 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8391) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8390) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-03 01:56:32,375 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (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|) .cse2))) (and (forall ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8390))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8391) .cse1 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8391) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8390) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-03 01:56:35,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8484))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8485) .cse1 v_ArrVal_8391) (select (select (store .cse2 .cse1 v_ArrVal_8390) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8392))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8484))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8390))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8485) .cse4 v_ArrVal_8391) .cse5 v_ArrVal_8392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-03 01:56:35,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [304391386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:35,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67162910] [2022-11-03 01:56:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:35,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:35,576 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:35,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3eb362-89be-424d-92dc-67bd3c54d4ed/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-11-03 01:56:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:36,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-03 01:56:36,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:36,761 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 01:56:36,794 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:56:36,794 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 01:56:36,810 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 01:56:36,830 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 01:56:36,932 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 01:56:36,939 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 01:56:37,042 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8882))) (exists ((v_ArrVal_8881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8881)))) is different from true [2022-11-03 01:56:37,135 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:56:37,161 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887)))) is different from true [2022-11-03 01:56:37,254 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892)))) is different from true [2022-11-03 01:56:37,409 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897)))) is different from true [2022-11-03 01:56:37,435 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:56:37,725 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908)))) is different from true [2022-11-03 01:56:37,885 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:56:37,910 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (exists ((v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8916)))) is different from true [2022-11-03 01:56:38,007 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:38,102 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923)))) is different from true [2022-11-03 01:56:38,195 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:38,289 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:56:38,517 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939)))) is different from true [2022-11-03 01:56:38,542 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8941) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:38,710 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:38,935 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955)))) is different from true [2022-11-03 01:56:38,961 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32)))) is different from true [2022-11-03 01:56:38,986 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:56:39,077 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:56:39,103 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966)))) is different from true [2022-11-03 01:56:39,248 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:39,248 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 01:56:39,269 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 01:56:39,393 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:39,393 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 01:56:39,414 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 01:56:39,508 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:39,508 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 01:56:39,519 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 01:56:39,580 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 01:56:39,592 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 01:56:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 714 not checked. [2022-11-03 01:56:39,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:39,693 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-03 01:56:39,740 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_8972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-03 01:56:39,833 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8970))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8969) .cse0 v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8969) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-03 01:56:39,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8969) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8970))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8969) .cse3 v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-03 01:56:42,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9063))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9064) .cse1 v_ArrVal_8969) (select (select (store .cse2 .cse1 v_ArrVal_8970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8971))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9063))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8970))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9064) .cse4 v_ArrVal_8969) .cse5 v_ArrVal_8971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-03 01:56:42,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67162910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:42,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:42,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 32, 32] total 89 [2022-11-03 01:56:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496171967] [2022-11-03 01:56:42,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:42,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-11-03 01:56:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:56:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-11-03 01:56:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=231, Unknown=104, NotChecked=10788, Total=11342 [2022-11-03 01:56:42,746 INFO L87 Difference]: Start difference. First operand 5083 states and 7441 transitions. Second operand has 90 states, 88 states have (on average 2.5568181818181817) internal successors, (225), 90 states have internal predecessors, (225), 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 01:56:43,859 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8302) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7722))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_8882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8882))) (exists ((v_ArrVal_8881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8881))) (exists ((v_ArrVal_8303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8303) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:56:43,875 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364)))) is different from true [2022-11-03 01:56:43,896 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324))) (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8941) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322))) (exists ((v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8916))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364)))) is different from true [2022-11-03 01:56:43,919 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8314) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324))) (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8315))) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8941) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322))) (exists ((v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8916))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364)))) is different from true [2022-11-03 01:56:43,944 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8314) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742))) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324))) (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8315))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8941) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322))) (exists ((v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8916))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359)))) is different from true [2022-11-03 01:56:43,970 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8314) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742))) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324))) (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8315))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8941) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322))) (exists ((v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8916))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359)))) is different from true [2022-11-03 01:56:43,996 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8314) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742))) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324))) (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8315))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8941) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322))) (exists ((v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8916))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359)))) is different from true [2022-11-03 01:56:44,023 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8314) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742))) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324))) (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8315))) (exists ((v_ArrVal_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8941) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8916))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359)))) is different from true [2022-11-03 01:56:44,051 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_8357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7799))) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8376 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8376) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8354 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8354))) (exists ((v_ArrVal_7755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7736 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7736))) (exists ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7766) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7798))) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786))) (exists ((v_ArrVal_8920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8920))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_8381 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8381))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325))) (exists ((v_ArrVal_8891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8891))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749))) (exists ((v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8312))) (exists ((v_ArrVal_8386 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8386) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8314) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8928))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8960))) (exists ((v_ArrVal_8942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792))) (exists ((v_ArrVal_7742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7742))) (exists ((v_ArrVal_8324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8324))) (exists ((v_ArrVal_8940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8940) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8898 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8898) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8914))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8355 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8355))) (exists ((v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7793))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8323))) (exists ((v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8957))) (exists ((v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8964) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8924))) (exists ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7797) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8315))) (exists ((v_ArrVal_7748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7748))) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8965))) (exists ((v_ArrVal_8356 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8356) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8353) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8931))) (exists ((v_ArrVal_7738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7738))) (exists ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8927))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8377 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8377))) (exists ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7770) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (exists ((v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7772) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8333))) (exists ((v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791))) (exists ((v_ArrVal_8907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8948))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7728))) (exists ((v_ArrVal_8919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731))) (exists ((v_ArrVal_7757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7757))) (exists ((v_ArrVal_8947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8947))) (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374))) (exists ((v_ArrVal_8368 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8368))) (exists ((v_ArrVal_8941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8941) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7740))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753))) (exists ((v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8332))) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8959) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7733 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7733))) (exists ((v_ArrVal_8956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8956) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759))) (exists ((v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8310) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8380))) (exists ((v_ArrVal_8932 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8932) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8888))) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7789) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8915))) (exists ((v_ArrVal_8966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8966))) (exists ((v_ArrVal_8886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8886))) (exists ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7779))) (exists ((v_ArrVal_7739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7739) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8939))) (exists ((v_ArrVal_8387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8387) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8900) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8913 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8913) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8908))) (exists ((v_ArrVal_8369 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8369) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8358))) (exists ((v_ArrVal_7802 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7802))) (exists ((v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8887))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773))) (exists ((v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8311))) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8885 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8885) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7761))) (exists ((v_ArrVal_8955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8955))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7758))) (exists ((v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7771) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8322))) (exists ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7765))) (exists ((v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8916))) (exists ((v_ArrVal_8318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8318))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784))) (exists ((v_ArrVal_8897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8897))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7737))) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788))) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8899 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8899) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_ArrVal_7756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7756))) (exists ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7796))) (exists ((v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7778) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8329))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_8892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8892))) (exists ((v_ArrVal_8352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8352))) (exists ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8328))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8923))) (exists ((v_ArrVal_8365 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8365))) (exists ((v_ArrVal_7790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7790))) (exists ((v_ArrVal_7780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7780))) (exists ((v_ArrVal_7803 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7803) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804))) (exists ((v_ArrVal_8319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8319))) (exists ((v_ArrVal_7747 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7747) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8364 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8364))) (exists ((v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7762) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8359 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8359)))) is different from true [2022-11-03 01:56:44,061 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7808))) (exists ((v_arrayElimCell_87 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_87) (_ bv44 32))) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7809 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7809) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724) |c_#memory_$Pointer$.base|))) is different from true