./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh --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 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 --- 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-2329fc7 [2022-12-14 14:13:53,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:13:53,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:13:53,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:13:53,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:13:53,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:13:53,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:13:53,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:13:53,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:13:53,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:13:53,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:13:53,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:13:53,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:13:53,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:13:53,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:13:53,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:13:53,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:13:53,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:13:53,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:13:53,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:13:53,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:13:53,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:13:53,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:13:53,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:13:53,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:13:53,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:13:53,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:13:53,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:13:53,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:13:53,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:13:53,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:13:53,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:13:53,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:13:53,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:13:53,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:13:53,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:13:53,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:13:53,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:13:53,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:13:53,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:13:53,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:13:53,107 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 14:13:53,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:13:53,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:13:53,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:13:53,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:13:53,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:13:53,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:13:53,121 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:13:53,121 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:13:53,121 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:13:53,122 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:13:53,122 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:13:53,122 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:13:53,122 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:13:53,122 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:13:53,122 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:13:53,122 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:13:53,122 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:13:53,122 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:13:53,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 14:13:53,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 14:13:53,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:13:53,123 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:13:53,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:13:53,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:13:53,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:13:53,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:13:53,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:13:53,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:13:53,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:13:53,125 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:13:53,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:13:53,125 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:13:53,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:13:53,125 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:13:53,125 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_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/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_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh 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 -> 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 [2022-12-14 14:13:53,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:13:53,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:13:53,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:13:53,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:13:53,335 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:13:53,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2022-12-14 14:13:55,935 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:13:56,207 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:13:56,208 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2022-12-14 14:13:56,221 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/data/446c51b82/1a1583085da04fe688507e923024229c/FLAG21d4ccdf9 [2022-12-14 14:13:56,508 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/data/446c51b82/1a1583085da04fe688507e923024229c [2022-12-14 14:13:56,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:13:56,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:13:56,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:13:56,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:13:56,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:13:56,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:13:56" (1/1) ... [2022-12-14 14:13:56,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cb7253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:56, skipping insertion in model container [2022-12-14 14:13:56,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:13:56" (1/1) ... [2022-12-14 14:13:56,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:13:56,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:13:56,862 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[33021,33034] [2022-12-14 14:13:56,958 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 14:13:56,960 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[49681,49694] [2022-12-14 14:13:56,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:13:56,989 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-12-14 14:13:56,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7109a03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:56, skipping insertion in model container [2022-12-14 14:13:56,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:13:56,991 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 14:13:56,992 INFO L158 Benchmark]: Toolchain (without parser) took 478.82ms. Allocated memory is still 140.5MB. Free memory was 101.7MB in the beginning and 78.0MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-14 14:13:56,993 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory was 109.8MB in the beginning and 109.7MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 14:13:56,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.11ms. Allocated memory is still 140.5MB. Free memory was 101.7MB in the beginning and 78.0MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-14 14:13:56,995 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.19ms. Allocated memory is still 140.5MB. Free memory was 109.8MB in the beginning and 109.7MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.11ms. Allocated memory is still 140.5MB. Free memory was 101.7MB in the beginning and 78.0MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh --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 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 --- 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-2329fc7 [2022-12-14 14:13:58,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:13:58,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:13:58,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:13:58,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:13:58,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:13:58,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:13:58,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:13:58,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:13:58,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:13:58,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:13:58,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:13:58,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:13:58,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:13:58,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:13:58,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:13:58,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:13:58,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:13:58,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:13:58,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:13:58,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:13:58,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:13:58,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:13:58,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:13:58,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:13:58,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:13:58,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:13:58,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:13:58,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:13:58,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:13:58,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:13:58,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:13:58,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:13:58,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:13:58,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:13:58,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:13:58,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:13:58,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:13:58,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:13:58,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:13:58,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:13:58,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 14:13:58,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:13:58,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:13:58,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:13:58,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:13:58,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:13:58,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:13:58,373 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:13:58,373 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:13:58,373 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:13:58,373 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:13:58,373 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:13:58,373 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:13:58,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 14:13:58,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 14:13:58,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:13:58,375 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:13:58,375 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:13:58,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:13:58,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:13:58,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:13:58,375 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 14:13:58,376 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 14:13:58,376 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 14:13:58,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:13:58,376 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 14:13:58,376 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 14:13:58,376 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 14:13:58,377 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:13:58,377 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:13:58,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:13:58,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 14:13:58,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:13:58,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:13:58,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:13:58,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:13:58,378 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 14:13:58,378 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 14:13:58,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:13:58,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 14:13:58,379 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_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/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_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh 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 -> 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 [2022-12-14 14:13:58,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:13:58,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:13:58,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:13:58,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:13:58,628 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:13:58,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2022-12-14 14:14:01,270 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:14:01,510 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:14:01,511 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2022-12-14 14:14:01,525 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/data/23538aa64/ca7e509563824eeb9950d651354f320f/FLAG23cb1810d [2022-12-14 14:14:01,536 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/data/23538aa64/ca7e509563824eeb9950d651354f320f [2022-12-14 14:14:01,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:14:01,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:14:01,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:14:01,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:14:01,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:14:01,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:14:01" (1/1) ... [2022-12-14 14:14:01,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8b4fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:01, skipping insertion in model container [2022-12-14 14:14:01,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:14:01" (1/1) ... [2022-12-14 14:14:01,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:14:01,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:14:01,893 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[33021,33034] [2022-12-14 14:14:01,976 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 14:14:01,979 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[49681,49694] [2022-12-14 14:14:01,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:14:02,005 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 14:14:02,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:14:02,050 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[33021,33034] [2022-12-14 14:14:02,112 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 14:14:02,114 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[49681,49694] [2022-12-14 14:14:02,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:14:02,132 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:14:02,158 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[33021,33034] [2022-12-14 14:14:02,213 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 14:14:02,215 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i[49681,49694] [2022-12-14 14:14:02,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:14:02,261 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:14:02,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02 WrapperNode [2022-12-14 14:14:02,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:14:02,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:14:02,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:14:02,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:14:02,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,366 INFO L138 Inliner]: procedures = 180, calls = 487, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1713 [2022-12-14 14:14:02,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:14:02,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:14:02,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:14:02,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:14:02,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,429 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:14:02,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:14:02,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:14:02,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:14:02,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (1/1) ... [2022-12-14 14:14:02,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:14:02,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:14:02,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:14:02,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:14:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 14:14:02,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-14 14:14:02,501 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-14 14:14:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 14:14:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:14:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 14:14:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 14:14:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:14:02,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:14:02,712 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:14:02,714 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:14:02,718 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-14 14:14:08,108 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:14:08,121 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:14:08,122 INFO L300 CfgBuilder]: Removed 100 assume(true) statements. [2022-12-14 14:14:08,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:14:08 BoogieIcfgContainer [2022-12-14 14:14:08,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:14:08,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:14:08,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:14:08,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:14:08,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:14:01" (1/3) ... [2022-12-14 14:14:08,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e19fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:14:08, skipping insertion in model container [2022-12-14 14:14:08,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:14:02" (2/3) ... [2022-12-14 14:14:08,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e19fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:14:08, skipping insertion in model container [2022-12-14 14:14:08,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:14:08" (3/3) ... [2022-12-14 14:14:08,134 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-3.i [2022-12-14 14:14:08,151 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:14:08,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 932 error locations. [2022-12-14 14:14:08,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:14:08,209 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;@7ac835c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:14:08,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 932 error locations. [2022-12-14 14:14:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 1831 states, 891 states have (on average 2.2648709315375983) internal successors, (2018), 1822 states have internal predecessors, (2018), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:14:08,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:08,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:14:08,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-12-14 14:14:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:08,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117727347] [2022-12-14 14:14:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:08,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:08,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:08,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:08,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 14:14:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:08,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 14:14:08,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:08,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:08,370 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:08,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117727347] [2022-12-14 14:14:08,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117727347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:08,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:08,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:14:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398992835] [2022-12-14 14:14:08,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:08,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 14:14:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:08,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 14:14:08,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:14:08,399 INFO L87 Difference]: Start difference. First operand has 1831 states, 891 states have (on average 2.2648709315375983) internal successors, (2018), 1822 states have internal predecessors, (2018), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:08,456 INFO L93 Difference]: Finished difference Result 1813 states and 1913 transitions. [2022-12-14 14:14:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 14:14:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 14:14:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:08,486 INFO L225 Difference]: With dead ends: 1813 [2022-12-14 14:14:08,486 INFO L226 Difference]: Without dead ends: 1811 [2022-12-14 14:14:08,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 14:14:08,491 INFO L413 NwaCegarLoop]: 1913 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:08,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:14:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-12-14 14:14:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2022-12-14 14:14:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 882 states have (on average 2.1417233560090705) internal successors, (1889), 1802 states have internal predecessors, (1889), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 1911 transitions. [2022-12-14 14:14:08,573 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 1911 transitions. Word has length 5 [2022-12-14 14:14:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:08,573 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 1911 transitions. [2022-12-14 14:14:08,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 1911 transitions. [2022-12-14 14:14:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:14:08,574 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:08,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:14:08,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:14:08,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:08,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-12-14 14:14:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:08,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054137010] [2022-12-14 14:14:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:08,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:08,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:08,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 14:14:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:09,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:14:09,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:09,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:14:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:09,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:09,092 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:09,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054137010] [2022-12-14 14:14:09,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054137010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:09,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:09,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:14:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009878136] [2022-12-14 14:14:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:09,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:14:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:09,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:14:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:09,095 INFO L87 Difference]: Start difference. First operand 1811 states and 1911 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:11,804 INFO L93 Difference]: Finished difference Result 2067 states and 2210 transitions. [2022-12-14 14:14:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:14:11,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 14:14:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:11,808 INFO L225 Difference]: With dead ends: 2067 [2022-12-14 14:14:11,808 INFO L226 Difference]: Without dead ends: 2067 [2022-12-14 14:14:11,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:11,809 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 1365 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:11,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1805 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-12-14 14:14:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-12-14 14:14:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1796. [2022-12-14 14:14:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 958 states have (on average 2.0177453027139873) internal successors, (1933), 1787 states have internal predecessors, (1933), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 1955 transitions. [2022-12-14 14:14:11,850 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 1955 transitions. Word has length 5 [2022-12-14 14:14:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:11,850 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 1955 transitions. [2022-12-14 14:14:11,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 1955 transitions. [2022-12-14 14:14:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 14:14:11,851 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:11,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 14:14:11,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 14:14:12,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:12,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-12-14 14:14:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:12,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996020332] [2022-12-14 14:14:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:12,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:12,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:12,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 14:14:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:12,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 14:14:12,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:12,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:14:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:12,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:12,237 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:12,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996020332] [2022-12-14 14:14:12,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996020332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:12,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:12,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:14:12,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134926046] [2022-12-14 14:14:12,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:12,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:14:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:14:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:12,239 INFO L87 Difference]: Start difference. First operand 1796 states and 1955 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:16,090 INFO L93 Difference]: Finished difference Result 2316 states and 2525 transitions. [2022-12-14 14:14:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:14:16,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 14:14:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:16,094 INFO L225 Difference]: With dead ends: 2316 [2022-12-14 14:14:16,094 INFO L226 Difference]: Without dead ends: 2316 [2022-12-14 14:14:16,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:16,095 INFO L413 NwaCegarLoop]: 1742 mSDtfsCounter, 741 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:16,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2540 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-12-14 14:14:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2022-12-14 14:14:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1952. [2022-12-14 14:14:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1124 states have (on average 1.9919928825622777) internal successors, (2239), 1943 states have internal predecessors, (2239), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2261 transitions. [2022-12-14 14:14:16,130 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2261 transitions. Word has length 5 [2022-12-14 14:14:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:16,131 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 2261 transitions. [2022-12-14 14:14:16,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2261 transitions. [2022-12-14 14:14:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 14:14:16,131 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:16,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 14:14:16,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 14:14:16,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:16,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-12-14 14:14:16,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:16,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990518069] [2022-12-14 14:14:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:16,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:16,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:16,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:16,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 14:14:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:16,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 14:14:16,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:16,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:16,432 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:16,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990518069] [2022-12-14 14:14:16,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990518069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:16,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:16,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:14:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312100125] [2022-12-14 14:14:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:14:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:14:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:16,434 INFO L87 Difference]: Start difference. First operand 1952 states and 2261 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:16,546 INFO L93 Difference]: Finished difference Result 3510 states and 4109 transitions. [2022-12-14 14:14:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:14:16,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 14:14:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:16,556 INFO L225 Difference]: With dead ends: 3510 [2022-12-14 14:14:16,556 INFO L226 Difference]: Without dead ends: 3510 [2022-12-14 14:14:16,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:16,557 INFO L413 NwaCegarLoop]: 2310 mSDtfsCounter, 1373 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 4110 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:16,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 4110 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:14:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2022-12-14 14:14:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 1954. [2022-12-14 14:14:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1126 states have (on average 1.9902309058614565) internal successors, (2241), 1945 states have internal predecessors, (2241), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2263 transitions. [2022-12-14 14:14:16,591 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2263 transitions. Word has length 6 [2022-12-14 14:14:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:16,591 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2263 transitions. [2022-12-14 14:14:16,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2263 transitions. [2022-12-14 14:14:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:14:16,591 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:16,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:16,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 14:14:16,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:16,793 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-12-14 14:14:16,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:16,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241780961] [2022-12-14 14:14:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:16,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:16,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:16,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:16,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 14:14:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:17,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 14:14:17,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:17,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:17,020 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:17,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241780961] [2022-12-14 14:14:17,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241780961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:17,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:17,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:14:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314584003] [2022-12-14 14:14:17,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:17,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:14:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:14:17,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:17,022 INFO L87 Difference]: Start difference. First operand 1954 states and 2263 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-12-14 14:14:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:17,057 INFO L93 Difference]: Finished difference Result 1918 states and 2226 transitions. [2022-12-14 14:14:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:14:17,057 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-12-14 14:14:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:17,060 INFO L225 Difference]: With dead ends: 1918 [2022-12-14 14:14:17,060 INFO L226 Difference]: Without dead ends: 1918 [2022-12-14 14:14:17,061 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-12-14 14:14:17,061 INFO L413 NwaCegarLoop]: 1762 mSDtfsCounter, 1732 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 1790 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-12-14 14:14:17,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 1790 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:14:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2022-12-14 14:14:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1912. [2022-12-14 14:14:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1108 states have (on average 1.983754512635379) internal successors, (2198), 1903 states have internal predecessors, (2198), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2220 transitions. [2022-12-14 14:14:17,091 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2220 transitions. Word has length 11 [2022-12-14 14:14:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:17,091 INFO L495 AbstractCegarLoop]: Abstraction has 1912 states and 2220 transitions. [2022-12-14 14:14:17,091 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-12-14 14:14:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2220 transitions. [2022-12-14 14:14:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:14:17,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:17,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:17,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 14:14:17,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:17,293 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:17,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-12-14 14:14:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:17,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243466354] [2022-12-14 14:14:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:17,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:17,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:17,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 14:14:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:17,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:14:17,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:17,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:17,436 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:17,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243466354] [2022-12-14 14:14:17,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243466354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:17,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:17,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:14:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058973668] [2022-12-14 14:14:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:17,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:14:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:14:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:14:17,437 INFO L87 Difference]: Start difference. First operand 1912 states and 2220 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-12-14 14:14:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:17,488 INFO L93 Difference]: Finished difference Result 1897 states and 2198 transitions. [2022-12-14 14:14:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:14:17,489 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-12-14 14:14:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:17,492 INFO L225 Difference]: With dead ends: 1897 [2022-12-14 14:14:17,492 INFO L226 Difference]: Without dead ends: 1897 [2022-12-14 14:14:17,492 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-12-14 14:14:17,492 INFO L413 NwaCegarLoop]: 1717 mSDtfsCounter, 1713 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:17,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 3455 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:14:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-12-14 14:14:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1890. [2022-12-14 14:14:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1100 states have (on average 1.971818181818182) internal successors, (2169), 1881 states have internal predecessors, (2169), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2191 transitions. [2022-12-14 14:14:17,512 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2191 transitions. Word has length 13 [2022-12-14 14:14:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:17,512 INFO L495 AbstractCegarLoop]: Abstraction has 1890 states and 2191 transitions. [2022-12-14 14:14:17,512 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-12-14 14:14:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2191 transitions. [2022-12-14 14:14:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:14:17,512 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:17,512 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-12-14 14:14:17,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 14:14:17,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:17,714 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-12-14 14:14:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:17,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249659009] [2022-12-14 14:14:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:17,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:17,716 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:17,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 14:14:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:17,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 14:14:17,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:17,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:14:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:17,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:17,945 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:17,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249659009] [2022-12-14 14:14:17,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249659009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:17,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:17,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:14:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761895180] [2022-12-14 14:14:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:17,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:14:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:17,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:14:17,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:14:17,948 INFO L87 Difference]: Start difference. First operand 1890 states and 2191 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:22,133 INFO L93 Difference]: Finished difference Result 3103 states and 3449 transitions. [2022-12-14 14:14:22,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:14:22,133 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-12-14 14:14:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:22,138 INFO L225 Difference]: With dead ends: 3103 [2022-12-14 14:14:22,138 INFO L226 Difference]: Without dead ends: 3103 [2022-12-14 14:14:22,138 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-12-14 14:14:22,139 INFO L413 NwaCegarLoop]: 1067 mSDtfsCounter, 3372 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3380 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:22,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3380 Valid, 2416 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-12-14 14:14:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2022-12-14 14:14:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 1886. [2022-12-14 14:14:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1100 states have (on average 1.9681818181818183) internal successors, (2165), 1877 states have internal predecessors, (2165), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2187 transitions. [2022-12-14 14:14:22,161 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2187 transitions. Word has length 27 [2022-12-14 14:14:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:22,161 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 2187 transitions. [2022-12-14 14:14:22,161 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-12-14 14:14:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2187 transitions. [2022-12-14 14:14:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:14:22,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:22,161 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-12-14 14:14:22,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 14:14:22,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:22,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-12-14 14:14:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766500843] [2022-12-14 14:14:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:22,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:22,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:22,369 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:22,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 14:14:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:22,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 14:14:22,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:22,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:14:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:22,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:22,764 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:22,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766500843] [2022-12-14 14:14:22,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766500843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:22,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:22,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:14:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572334465] [2022-12-14 14:14:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:22,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:14:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:14:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:14:22,766 INFO L87 Difference]: Start difference. First operand 1886 states and 2187 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-12-14 14:14:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:27,943 INFO L93 Difference]: Finished difference Result 2632 states and 2851 transitions. [2022-12-14 14:14:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:14:27,944 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-12-14 14:14:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:27,947 INFO L225 Difference]: With dead ends: 2632 [2022-12-14 14:14:27,947 INFO L226 Difference]: Without dead ends: 2632 [2022-12-14 14:14:27,948 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-12-14 14:14:27,948 INFO L413 NwaCegarLoop]: 1268 mSDtfsCounter, 1687 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:27,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 2873 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 14:14:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2022-12-14 14:14:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 1882. [2022-12-14 14:14:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1100 states have (on average 1.9645454545454546) internal successors, (2161), 1873 states have internal predecessors, (2161), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2183 transitions. [2022-12-14 14:14:27,964 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2183 transitions. Word has length 27 [2022-12-14 14:14:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:27,964 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2183 transitions. [2022-12-14 14:14:27,964 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-12-14 14:14:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2183 transitions. [2022-12-14 14:14:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 14:14:27,965 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:27,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:27,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-14 14:14:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:28,167 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-12-14 14:14:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205619183] [2022-12-14 14:14:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:28,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:28,172 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:28,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 14:14:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:28,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:14:28,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:28,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:28,379 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:28,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205619183] [2022-12-14 14:14:28,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205619183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:28,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:28,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:14:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587066759] [2022-12-14 14:14:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:28,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:14:28,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:14:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:14:28,381 INFO L87 Difference]: Start difference. First operand 1882 states and 2183 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:28,428 INFO L93 Difference]: Finished difference Result 1882 states and 2179 transitions. [2022-12-14 14:14:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:14:28,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-12-14 14:14:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:28,431 INFO L225 Difference]: With dead ends: 1882 [2022-12-14 14:14:28,432 INFO L226 Difference]: Without dead ends: 1882 [2022-12-14 14:14:28,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:14:28,432 INFO L413 NwaCegarLoop]: 1711 mSDtfsCounter, 1682 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:28,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 3433 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:14:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-12-14 14:14:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1876. [2022-12-14 14:14:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1094 states have (on average 1.9661791590493602) internal successors, (2151), 1867 states have internal predecessors, (2151), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2173 transitions. [2022-12-14 14:14:28,446 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2173 transitions. Word has length 42 [2022-12-14 14:14:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:28,447 INFO L495 AbstractCegarLoop]: Abstraction has 1876 states and 2173 transitions. [2022-12-14 14:14:28,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2173 transitions. [2022-12-14 14:14:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 14:14:28,447 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:28,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:28,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 14:14:28,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:28,649 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-12-14 14:14:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:28,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401026779] [2022-12-14 14:14:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:28,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:28,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:28,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:28,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 14:14:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:28,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:14:28,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:29,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:29,063 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:29,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401026779] [2022-12-14 14:14:29,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401026779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:29,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:29,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:14:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199423514] [2022-12-14 14:14:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:29,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:14:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:29,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:14:29,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:29,065 INFO L87 Difference]: Start difference. First operand 1876 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:29,267 INFO L93 Difference]: Finished difference Result 2295 states and 2609 transitions. [2022-12-14 14:14:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:14:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-12-14 14:14:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:29,272 INFO L225 Difference]: With dead ends: 2295 [2022-12-14 14:14:29,272 INFO L226 Difference]: Without dead ends: 2295 [2022-12-14 14:14:29,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:14:29,272 INFO L413 NwaCegarLoop]: 1789 mSDtfsCounter, 455 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3374 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:29,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3374 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:14:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2022-12-14 14:14:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1922. [2022-12-14 14:14:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1140 states have (on average 1.9271929824561405) internal successors, (2197), 1913 states have internal predecessors, (2197), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:29,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2219 transitions. [2022-12-14 14:14:29,288 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2219 transitions. Word has length 50 [2022-12-14 14:14:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:29,288 INFO L495 AbstractCegarLoop]: Abstraction has 1922 states and 2219 transitions. [2022-12-14 14:14:29,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2219 transitions. [2022-12-14 14:14:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 14:14:29,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:29,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:29,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 14:14:29,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:29,490 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-12-14 14:14:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:29,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127184578] [2022-12-14 14:14:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:29,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:29,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:29,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:29,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 14:14:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:29,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 14:14:29,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:29,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:14:29,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:14:30,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:14:30,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 14:14:30,116 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:14:30,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:14:30,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-12-14 14:14:30,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:30,127 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:30,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127184578] [2022-12-14 14:14:30,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127184578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:30,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:30,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:14:30,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319606812] [2022-12-14 14:14:30,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:30,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:14:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:30,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:14:30,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:14:30,128 INFO L87 Difference]: Start difference. First operand 1922 states and 2219 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:33,647 INFO L93 Difference]: Finished difference Result 2109 states and 2390 transitions. [2022-12-14 14:14:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:14:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-12-14 14:14:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:33,653 INFO L225 Difference]: With dead ends: 2109 [2022-12-14 14:14:33,653 INFO L226 Difference]: Without dead ends: 2109 [2022-12-14 14:14:33,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:14:33,654 INFO L413 NwaCegarLoop]: 813 mSDtfsCounter, 1521 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:33,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 1304 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 14:14:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2022-12-14 14:14:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1672. [2022-12-14 14:14:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 974 states have (on average 1.8439425051334701) internal successors, (1796), 1663 states have internal predecessors, (1796), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1818 transitions. [2022-12-14 14:14:33,673 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1818 transitions. Word has length 53 [2022-12-14 14:14:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:33,673 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1818 transitions. [2022-12-14 14:14:33,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1818 transitions. [2022-12-14 14:14:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 14:14:33,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:33,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:33,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-12-14 14:14:33,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:33,876 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-12-14 14:14:33,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:33,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331284909] [2022-12-14 14:14:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:33,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:33,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:33,882 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:33,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 14:14:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:34,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 14:14:34,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:34,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:14:34,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:14:34,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 14:14:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:34,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:34,151 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:34,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331284909] [2022-12-14 14:14:34,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331284909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:34,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:34,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:14:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546915457] [2022-12-14 14:14:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:34,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:14:34,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:34,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:14:34,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:14:34,152 INFO L87 Difference]: Start difference. First operand 1672 states and 1818 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:37,561 INFO L93 Difference]: Finished difference Result 1671 states and 1817 transitions. [2022-12-14 14:14:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:14:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 14:14:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:37,564 INFO L225 Difference]: With dead ends: 1671 [2022-12-14 14:14:37,564 INFO L226 Difference]: Without dead ends: 1671 [2022-12-14 14:14:37,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:14:37,565 INFO L413 NwaCegarLoop]: 1631 mSDtfsCounter, 4 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4144 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:37,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4144 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-14 14:14:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-12-14 14:14:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2022-12-14 14:14:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 974 states have (on average 1.8429158110882957) internal successors, (1795), 1662 states have internal predecessors, (1795), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1817 transitions. [2022-12-14 14:14:37,578 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1817 transitions. Word has length 58 [2022-12-14 14:14:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:37,578 INFO L495 AbstractCegarLoop]: Abstraction has 1671 states and 1817 transitions. [2022-12-14 14:14:37,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1817 transitions. [2022-12-14 14:14:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 14:14:37,579 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:37,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:37,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-14 14:14:37,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:37,780 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-12-14 14:14:37,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:37,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116298808] [2022-12-14 14:14:37,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:37,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:37,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:37,787 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:37,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-14 14:14:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:38,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 14:14:38,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:38,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:14:38,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:14:38,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:14:38,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-14 14:14:38,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 14:14:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:38,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:38,092 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:38,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116298808] [2022-12-14 14:14:38,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116298808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:38,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:38,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:14:38,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065388489] [2022-12-14 14:14:38,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:38,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:14:38,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:38,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:14:38,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:14:38,094 INFO L87 Difference]: Start difference. First operand 1671 states and 1817 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:42,678 INFO L93 Difference]: Finished difference Result 1670 states and 1816 transitions. [2022-12-14 14:14:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:14:42,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 14:14:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:42,681 INFO L225 Difference]: With dead ends: 1670 [2022-12-14 14:14:42,681 INFO L226 Difference]: Without dead ends: 1670 [2022-12-14 14:14:42,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:14:42,681 INFO L413 NwaCegarLoop]: 1631 mSDtfsCounter, 2 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4202 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:42,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4202 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-12-14 14:14:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2022-12-14 14:14:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2022-12-14 14:14:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 973 states have (on average 1.8437821171634121) internal successors, (1794), 1661 states have internal predecessors, (1794), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 14:14:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 1816 transitions. [2022-12-14 14:14:42,693 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 1816 transitions. Word has length 58 [2022-12-14 14:14:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:42,693 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 1816 transitions. [2022-12-14 14:14:42,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:14:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 1816 transitions. [2022-12-14 14:14:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 14:14:42,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:42,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:42,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-14 14:14:42,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:42,895 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2024861438, now seen corresponding path program 1 times [2022-12-14 14:14:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:42,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352020007] [2022-12-14 14:14:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:42,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:42,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:42,900 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:42,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-14 14:14:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:43,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:14:43,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:43,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:14:43,133 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:43,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352020007] [2022-12-14 14:14:43,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352020007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:14:43,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:14:43,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:14:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936755238] [2022-12-14 14:14:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:14:43,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:14:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:43,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:14:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:14:43,135 INFO L87 Difference]: Start difference. First operand 1670 states and 1816 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 14:14:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:43,198 INFO L93 Difference]: Finished difference Result 1673 states and 1821 transitions. [2022-12-14 14:14:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:14:43,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-12-14 14:14:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:43,202 INFO L225 Difference]: With dead ends: 1673 [2022-12-14 14:14:43,202 INFO L226 Difference]: Without dead ends: 1673 [2022-12-14 14:14:43,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:14:43,202 INFO L413 NwaCegarLoop]: 1630 mSDtfsCounter, 2 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4882 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:43,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4882 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:14:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-12-14 14:14:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2022-12-14 14:14:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 975 states have (on average 1.843076923076923) internal successors, (1797), 1664 states have internal predecessors, (1797), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 14:14:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1821 transitions. [2022-12-14 14:14:43,221 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1821 transitions. Word has length 66 [2022-12-14 14:14:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:43,221 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 1821 transitions. [2022-12-14 14:14:43,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 14:14:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1821 transitions. [2022-12-14 14:14:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 14:14:43,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:43,222 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-12-14 14:14:43,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-14 14:14:43,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:43,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1657441321, now seen corresponding path program 1 times [2022-12-14 14:14:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:43,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892446241] [2022-12-14 14:14:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:43,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:43,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:43,430 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:43,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-14 14:14:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:43,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 14:14:43,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:43,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:14:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:43,743 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892446241] [2022-12-14 14:14:43,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892446241] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:14:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [163220693] [2022-12-14 14:14:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:14:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:14:43,745 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:14:43,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-12-14 14:14:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:44,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 14:14:44,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:44,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:14:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:44,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [163220693] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:14:44,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9081895] [2022-12-14 14:14:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:14:44,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:14:44,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:14:44,218 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:14:44,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 14:14:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:14:44,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 14:14:44,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:44,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:14:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:44,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9081895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:14:44,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 14:14:44,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-12-14 14:14:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578764026] [2022-12-14 14:14:44,448 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 14:14:44,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:14:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:14:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:14:44,450 INFO L87 Difference]: Start difference. First operand 1673 states and 1821 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 14:14:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:14:44,629 INFO L93 Difference]: Finished difference Result 1685 states and 1839 transitions. [2022-12-14 14:14:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:14:44,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-12-14 14:14:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:14:44,633 INFO L225 Difference]: With dead ends: 1685 [2022-12-14 14:14:44,633 INFO L226 Difference]: Without dead ends: 1685 [2022-12-14 14:14:44,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:14:44,633 INFO L413 NwaCegarLoop]: 1630 mSDtfsCounter, 11 mSDsluCounter, 4873 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6503 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:14:44,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6503 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:14:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2022-12-14 14:14:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2022-12-14 14:14:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 984 states have (on average 1.8414634146341464) internal successors, (1812), 1673 states have internal predecessors, (1812), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 14:14:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 1836 transitions. [2022-12-14 14:14:44,657 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 1836 transitions. Word has length 67 [2022-12-14 14:14:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:14:44,657 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 1836 transitions. [2022-12-14 14:14:44,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 14:14:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1836 transitions. [2022-12-14 14:14:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 14:14:44,657 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:14:44,657 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:14:44,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 14:14:44,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-12-14 14:14:45,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2022-12-14 14:14:45,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 14:14:45,260 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:14:45,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:14:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1206395586, now seen corresponding path program 2 times [2022-12-14 14:14:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:14:45,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334754955] [2022-12-14 14:14:45,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:14:45,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:14:45,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:14:45,265 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:14:45,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-14 14:14:45,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:14:45,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:14:45,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 14:14:45,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:45,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:14:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:45,831 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:14:45,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334754955] [2022-12-14 14:14:45,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334754955] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:14:45,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2094079467] [2022-12-14 14:14:45,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:14:45,831 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:14:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:14:45,832 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:14:45,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-12-14 14:14:46,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:14:46,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:14:46,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 14:14:46,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:46,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:14:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:14:46,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2094079467] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:14:46,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551930292] [2022-12-14 14:14:46,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:14:46,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:14:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:14:46,948 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:14:46,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 14:14:51,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:14:51,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:14:51,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 14:14:51,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:14:51,839 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:14:51,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:14:51,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:14:52,152 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:14:52,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:14:52,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 14:14:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 14:14:52,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:14:52,321 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 14:14:52,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 14:14:52,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551930292] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:14:52,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 14:14:52,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2022-12-14 14:14:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151437532] [2022-12-14 14:14:52,414 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 14:14:52,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 14:14:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:14:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 14:14:52,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=549, Unknown=11, NotChecked=0, Total=650 [2022-12-14 14:14:52,417 INFO L87 Difference]: Start difference. First operand 1683 states and 1836 transitions. Second operand has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 14:15:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:15:07,758 INFO L93 Difference]: Finished difference Result 1974 states and 2123 transitions. [2022-12-14 14:15:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 14:15:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2022-12-14 14:15:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:15:07,761 INFO L225 Difference]: With dead ends: 1974 [2022-12-14 14:15:07,761 INFO L226 Difference]: Without dead ends: 1970 [2022-12-14 14:15:07,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=478, Invalid=2790, Unknown=38, NotChecked=0, Total=3306 [2022-12-14 14:15:07,762 INFO L413 NwaCegarLoop]: 1036 mSDtfsCounter, 2747 mSDsluCounter, 13195 mSDsCounter, 0 mSdLazyCounter, 10378 mSolverCounterSat, 108 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 14231 SdHoareTripleChecker+Invalid, 10492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 10378 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:15:07,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 14231 Invalid, 10492 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 10378 Invalid, 6 Unknown, 0 Unchecked, 14.0s Time] [2022-12-14 14:15:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-12-14 14:15:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1691. [2022-12-14 14:15:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 993 states have (on average 1.8358509566968781) internal successors, (1823), 1681 states have internal predecessors, (1823), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 14:15:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 1847 transitions. [2022-12-14 14:15:07,779 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 1847 transitions. Word has length 70 [2022-12-14 14:15:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:15:07,780 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 1847 transitions. [2022-12-14 14:15:07,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 14:15:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 1847 transitions. [2022-12-14 14:15:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 14:15:07,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:15:07,780 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:15:07,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-14 14:15:08,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 14:15:08,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-12-14 14:15:08,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 14:15:08,383 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:15:08,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:15:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -365877601, now seen corresponding path program 1 times [2022-12-14 14:15:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:15:08,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666550841] [2022-12-14 14:15:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:15:08,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:15:08,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:15:08,386 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:15:08,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-12-14 14:15:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:15:08,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 14:15:08,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:15:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:08,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:15:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:09,209 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:15:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666550841] [2022-12-14 14:15:09,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666550841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:15:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [323871337] [2022-12-14 14:15:09,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:15:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:15:09,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:15:09,211 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:15:09,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-12-14 14:15:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:15:09,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 14:15:09,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:15:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:09,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:15:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:09,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [323871337] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:15:09,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321586357] [2022-12-14 14:15:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:15:09,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:15:09,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:15:09,801 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:15:09,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 14:15:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:15:10,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 14:15:10,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:15:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:10,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:15:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:10,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321586357] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:15:10,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 14:15:10,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-12-14 14:15:10,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145275821] [2022-12-14 14:15:10,872 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 14:15:10,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 14:15:10,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:15:10,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 14:15:10,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 14:15:10,874 INFO L87 Difference]: Start difference. First operand 1691 states and 1847 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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-12-14 14:15:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:15:13,961 INFO L93 Difference]: Finished difference Result 1733 states and 1913 transitions. [2022-12-14 14:15:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 14:15:13,962 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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 76 [2022-12-14 14:15:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:15:13,964 INFO L225 Difference]: With dead ends: 1733 [2022-12-14 14:15:13,964 INFO L226 Difference]: Without dead ends: 1727 [2022-12-14 14:15:13,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 14:15:13,965 INFO L413 NwaCegarLoop]: 1636 mSDtfsCounter, 54 mSDsluCounter, 19581 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 21217 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:15:13,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 21217 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 14:15:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-12-14 14:15:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1709. [2022-12-14 14:15:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1011 states have (on average 1.8259149357072206) internal successors, (1846), 1699 states have internal predecessors, (1846), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 14:15:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 1870 transitions. [2022-12-14 14:15:13,987 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 1870 transitions. Word has length 76 [2022-12-14 14:15:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:15:13,987 INFO L495 AbstractCegarLoop]: Abstraction has 1709 states and 1870 transitions. [2022-12-14 14:15:13,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 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-12-14 14:15:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 1870 transitions. [2022-12-14 14:15:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 14:15:13,988 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:15:13,989 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:15:13,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 14:15:14,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-12-14 14:15:14,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-12-14 14:15:14,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:15:14,591 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:15:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:15:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2057559713, now seen corresponding path program 2 times [2022-12-14 14:15:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:15:14,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369839122] [2022-12-14 14:15:14,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:15:14,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:15:14,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:15:14,595 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:15:14,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-12-14 14:15:15,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:15:15,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:15:15,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 14:15:15,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:15:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:15,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:15:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:18,422 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:15:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369839122] [2022-12-14 14:15:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369839122] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:15:18,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [730636126] [2022-12-14 14:15:18,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:15:18,423 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:15:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:15:18,424 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:15:18,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-12-14 14:15:19,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:15:19,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:15:19,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 14:15:19,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:15:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:19,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:15:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:15:20,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [730636126] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:15:20,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598106427] [2022-12-14 14:15:20,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:15:20,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:15:20,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:15:20,923 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:15:20,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 14:15:44,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:15:44,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:15:44,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 14:15:44,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:15:44,313 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:15:44,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:15:44,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:15:44,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:15:44,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:15:44,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:15:44,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 14:15:44,978 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425)))) is different from true [2022-12-14 14:15:44,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427))) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:15:45,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2430) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2429))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 14:15:45,011 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2432))) (exists ((v_ArrVal_2431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2431) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 14:15:45,022 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434)))) is different from true [2022-12-14 14:15:45,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436)))) is different from true [2022-12-14 14:15:45,152 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 14:15:45,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:15:45,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2443))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2444)))) is different from true [2022-12-14 14:15:45,178 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2446))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2445)))) is different from true [2022-12-14 14:15:45,186 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448)))) is different from true [2022-12-14 14:15:45,195 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450)))) is different from true [2022-12-14 14:15:45,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:15:45,212 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32)))) is different from true [2022-12-14 14:15:45,220 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-12-14 14:15:45,228 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458)))) is different from true [2022-12-14 14:15:45,237 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459)))) is different from true [2022-12-14 14:15:45,246 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:15:45,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463)))) is different from true [2022-12-14 14:15:45,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465)))) is different from true [2022-12-14 14:15:45,294 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:15:45,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:15:45,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:15:45,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 14:15:45,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 14:15:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 250 not checked. [2022-12-14 14:15:45,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:15:46,188 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2514) |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~mem33#1.base| v_ArrVal_2513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 14:15:46,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598106427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:15:46,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 14:15:46,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 29] total 78 [2022-12-14 14:15:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067545140] [2022-12-14 14:15:46,194 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 14:15:46,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-14 14:15:46,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:15:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-14 14:15:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=738, Invalid=2841, Unknown=45, NotChecked=2856, Total=6480 [2022-12-14 14:15:46,198 INFO L87 Difference]: Start difference. First operand 1709 states and 1870 transitions. Second operand has 78 states, 77 states have (on average 2.4545454545454546) internal successors, (189), 78 states have internal predecessors, (189), 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-12-14 14:15:59,028 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_ArrVal_2424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2424) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2423) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465)))) is different from true [2022-12-14 14:16:00,298 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465)))) is different from true [2022-12-14 14:16:20,905 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvult |c_#Ultimate.C_memset_#t~loopctr401| |c_#Ultimate.C_memset_#amount|)) (.cse2 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr401| (_ bv1 32)) |c_#Ultimate.C_memset_#amount|)) (.cse0 (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32)))) (.cse3 (bvult (bvadd (_ bv2 32) |c_#Ultimate.C_memset_#t~loopctr401|) |c_#Ultimate.C_memset_#amount|))) (and (exists ((v_ArrVal_2430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2430) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2446))) (exists ((v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2443))) (or .cse0 .cse1) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (or .cse0 (not .cse2) .cse3) (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (or (not .cse1) .cse0 .cse2) (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))) (exists ((v_ArrVal_2424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2424) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2432))) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (exists ((v_ArrVal_2431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2431) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2429))) (or .cse0 (bvult (bvadd |c_#Ultimate.C_memset_#t~loopctr401| (_ bv5 32)) |c_#Ultimate.C_memset_#amount|) (not (bvult (bvadd (_ bv4 32) |c_#Ultimate.C_memset_#t~loopctr401|) |c_#Ultimate.C_memset_#amount|))) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (or .cse0 (bvult (bvadd (_ bv3 32) |c_#Ultimate.C_memset_#t~loopctr401|) |c_#Ultimate.C_memset_#amount|) (not .cse3)) (exists ((v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2423) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459))) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2445))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2444))) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436))) (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434))))) is different from true [2022-12-14 14:16:26,779 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2430) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2446))) (exists ((v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2443))) (or (not (= |c_#Ultimate.C_memset_#amount| (_ bv44 32))) (bvult |c_#Ultimate.C_memset_#t~loopctr401| |c_#Ultimate.C_memset_#amount|)) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))) (exists ((v_ArrVal_2424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2424) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2432))) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (exists ((v_ArrVal_2431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2431) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2429))) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2423) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459))) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2445))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2444))) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436))) (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434)))) is different from true [2022-12-14 14:16:28,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2430) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2446 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2446))) (exists ((v_ArrVal_2443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2443))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2455) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2440))) (exists ((v_ArrVal_2439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2439))) (exists ((v_ArrVal_2449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2449))) (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2454) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2453 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2453) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464))) (exists ((v_ArrVal_2424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2424) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2432))) (exists ((v_ArrVal_2426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2426))) (exists ((v_ArrVal_2431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2431) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2429))) (exists ((v_ArrVal_2447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2447))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2423) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2450))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_ArrVal_2433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2433))) (exists ((v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2451))) (exists ((v_ArrVal_2441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2441))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459))) (exists ((v_ArrVal_2427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2427))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456))) (exists ((v_ArrVal_2425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2425))) (exists ((v_ArrVal_2445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2445))) (exists ((v_ArrVal_2435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2435))) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_ArrVal_2442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2442) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2444))) (exists ((v_ArrVal_2428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2428) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2448))) (exists ((v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2452) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2436))) (exists ((v_ArrVal_2434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2434)))) is different from true [2022-12-14 14:17:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:17:24,956 INFO L93 Difference]: Finished difference Result 3534 states and 3953 transitions. [2022-12-14 14:17:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-12-14 14:17:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 2.4545454545454546) internal successors, (189), 78 states have internal predecessors, (189), 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 88 [2022-12-14 14:17:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:17:24,961 INFO L225 Difference]: With dead ends: 3534 [2022-12-14 14:17:24,961 INFO L226 Difference]: Without dead ends: 3515 [2022-12-14 14:17:24,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 355 SyntacticMatches, 8 SemanticMatches, 189 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 7254 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=5745, Invalid=21200, Unknown=219, NotChecked=9126, Total=36290 [2022-12-14 14:17:24,966 INFO L413 NwaCegarLoop]: 1069 mSDtfsCounter, 3984 mSDsluCounter, 30634 mSDsCounter, 0 mSdLazyCounter, 28496 mSolverCounterSat, 430 mSolverCounterUnsat, 686 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4063 SdHoareTripleChecker+Valid, 31703 SdHoareTripleChecker+Invalid, 97361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 28496 IncrementalHoareTripleChecker+Invalid, 686 IncrementalHoareTripleChecker+Unknown, 67749 IncrementalHoareTripleChecker+Unchecked, 45.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:17:24,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4063 Valid, 31703 Invalid, 97361 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [430 Valid, 28496 Invalid, 686 Unknown, 67749 Unchecked, 45.7s Time] [2022-12-14 14:17:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2022-12-14 14:17:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 1795. [2022-12-14 14:17:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1097 states have (on average 1.7730173199635368) internal successors, (1945), 1784 states have internal predecessors, (1945), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 14:17:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 1969 transitions. [2022-12-14 14:17:24,995 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 1969 transitions. Word has length 88 [2022-12-14 14:17:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:17:24,996 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 1969 transitions. [2022-12-14 14:17:24,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 2.4545454545454546) internal successors, (189), 78 states have internal predecessors, (189), 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-12-14 14:17:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 1969 transitions. [2022-12-14 14:17:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 14:17:24,996 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:17:24,997 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:17:25,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-12-14 14:17:25,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-12-14 14:17:25,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 14:17:25,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:17:25,599 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:17:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:17:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1505974903, now seen corresponding path program 1 times [2022-12-14 14:17:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:17:25,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75799881] [2022-12-14 14:17:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:17:25,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:17:25,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:17:25,606 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:17:25,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-12-14 14:17:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:17:26,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 14:17:26,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:17:26,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:17:26,384 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 14:17:26,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 14:17:26,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:17:26,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 14:17:26,693 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2885)))) is different from true [2022-12-14 14:17:26,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2895) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:17:27,265 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:17:27,667 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:17:27,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:17:27,753 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:17:27,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:17:27,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 14:17:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-12-14 14:17:27,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:17:27,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 14:17:27,843 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (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_2923) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 14:17:28,047 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2969))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2923)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 14:17:28,050 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:17:28,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75799881] [2022-12-14 14:17:28,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75799881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:17:28,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [194696198] [2022-12-14 14:17:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:17:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:17:28,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:17:28,051 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:17:28,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-12-14 14:17:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:17:31,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 14:17:31,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:17:31,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:17:31,222 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 14:17:31,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 14:17:31,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:17:31,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 14:17:31,528 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3342)))) is different from true [2022-12-14 14:17:31,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_23))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))) (not (= v_arrayElimCell_23 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)))) (exists ((v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3345)))) is different from true [2022-12-14 14:17:32,419 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:17:32,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:17:32,469 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:17:32,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:17:32,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 14:17:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-12-14 14:17:32,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:17:34,558 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3378) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 14:17:34,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3424))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3378)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 14:17:34,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [194696198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:17:34,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832773784] [2022-12-14 14:17:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:17:34,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:17:34,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:17:34,757 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:17:34,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 14:17:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:17:35,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 14:17:35,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:17:35,315 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:17:35,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:17:35,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:17:35,480 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3787))) is different from true [2022-12-14 14:17:35,486 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3788 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3788))) is different from true [2022-12-14 14:17:35,491 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3789))) is different from true [2022-12-14 14:17:35,496 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3790))) is different from true [2022-12-14 14:17:35,501 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3791) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,507 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3792))) is different from true [2022-12-14 14:17:35,512 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3793) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,516 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3794))) is different from true [2022-12-14 14:17:35,521 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3795))) is different from true [2022-12-14 14:17:35,526 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3796) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,531 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3797 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3797))) is different from true [2022-12-14 14:17:35,536 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3798 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3798))) is different from true [2022-12-14 14:17:35,541 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3799 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3799))) is different from true [2022-12-14 14:17:35,546 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3800 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3800) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,550 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3801) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,555 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3802 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3802) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,560 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3803 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3803))) is different from true [2022-12-14 14:17:35,565 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3804 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3804))) is different from true [2022-12-14 14:17:35,570 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3805 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3805))) is different from true [2022-12-14 14:17:35,574 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3806))) is different from true [2022-12-14 14:17:35,579 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3807))) is different from true [2022-12-14 14:17:35,584 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3808 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3808) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,588 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3809))) is different from true [2022-12-14 14:17:35,593 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3810))) is different from true [2022-12-14 14:17:35,598 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3811))) is different from true [2022-12-14 14:17:35,603 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3812))) is different from true [2022-12-14 14:17:35,608 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3813))) is different from true [2022-12-14 14:17:35,613 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3814) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,618 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3815) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,623 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3816) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,628 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3817 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3817))) is different from true [2022-12-14 14:17:35,632 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3818))) is different from true [2022-12-14 14:17:35,637 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3819 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3819))) is different from true [2022-12-14 14:17:35,642 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3820 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3820))) is different from true [2022-12-14 14:17:35,647 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3821))) is different from true [2022-12-14 14:17:35,652 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3822 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3822) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,657 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3823))) is different from true [2022-12-14 14:17:35,662 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3824) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,667 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3825) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,671 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3826))) is different from true [2022-12-14 14:17:35,676 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3827))) is different from true [2022-12-14 14:17:35,681 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3828 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3828) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:17:35,686 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3829))) is different from true [2022-12-14 14:17:35,691 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3830 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3830))) is different from true [2022-12-14 14:17:35,712 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:17:35,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 14:17:35,801 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:17:35,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:17:35,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 14:17:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 14:17:35,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:17:35,889 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 14:17:35,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 14:17:35,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem35#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3831) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2022-12-14 14:17:35,906 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32)))) (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))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-12-14 14:17:36,113 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3877)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-12-14 14:17:36,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832773784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:17:36,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:17:36,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 54] total 66 [2022-12-14 14:17:36,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093976971] [2022-12-14 14:17:36,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:17:36,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-14 14:17:36,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:17:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-14 14:17:36,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=361, Unknown=71, NotChecked=5244, Total=5852 [2022-12-14 14:17:36,119 INFO L87 Difference]: Start difference. First operand 1795 states and 1969 transitions. Second operand has 67 states, 64 states have (on average 2.5625) internal successors, (164), 67 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 14:18:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:18:00,025 INFO L93 Difference]: Finished difference Result 2827 states and 3088 transitions. [2022-12-14 14:18:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-14 14:18:00,025 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 2.5625) internal successors, (164), 67 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-12-14 14:18:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:18:00,031 INFO L225 Difference]: With dead ends: 2827 [2022-12-14 14:18:00,031 INFO L226 Difference]: Without dead ends: 2827 [2022-12-14 14:18:00,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 197 SyntacticMatches, 87 SemanticMatches, 83 ConstructedPredicates, 57 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=254, Invalid=651, Unknown=79, NotChecked=6156, Total=7140 [2022-12-14 14:18:00,032 INFO L413 NwaCegarLoop]: 1094 mSDtfsCounter, 3168 mSDsluCounter, 8609 mSDsCounter, 0 mSdLazyCounter, 7606 mSolverCounterSat, 64 mSolverCounterUnsat, 2036 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3181 SdHoareTripleChecker+Valid, 9703 SdHoareTripleChecker+Invalid, 150988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 7606 IncrementalHoareTripleChecker+Invalid, 2036 IncrementalHoareTripleChecker+Unknown, 141282 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:18:00,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3181 Valid, 9703 Invalid, 150988 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 7606 Invalid, 2036 Unknown, 141282 Unchecked, 23.2s Time] [2022-12-14 14:18:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-12-14 14:18:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 1794. [2022-12-14 14:18:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1097 states have (on average 1.772105742935278) internal successors, (1944), 1783 states have internal predecessors, (1944), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 14:18:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 1968 transitions. [2022-12-14 14:18:00,053 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 1968 transitions. Word has length 113 [2022-12-14 14:18:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:18:00,053 INFO L495 AbstractCegarLoop]: Abstraction has 1794 states and 1968 transitions. [2022-12-14 14:18:00,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 2.5625) internal successors, (164), 67 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 14:18:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 1968 transitions. [2022-12-14 14:18:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 14:18:00,054 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:18:00,054 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:18:00,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-12-14 14:18:00,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 14:18:00,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-12-14 14:18:00,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:18:00,656 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:18:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:18:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1505974904, now seen corresponding path program 1 times [2022-12-14 14:18:00,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:18:00,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253200558] [2022-12-14 14:18:00,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:18:00,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:18:00,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:18:00,661 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:18:00,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-12-14 14:18:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:18:01,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 113 conjunts are in the unsatisfiable core [2022-12-14 14:18:01,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:18:01,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:18:01,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:18:01,664 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:18:01,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:18:01,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:18:01,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:18:01,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:18:01,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 14:18:01,850 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4245))) (exists ((v_ArrVal_4244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4244) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:01,861 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4246))) (exists ((v_ArrVal_4247 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4247)))) is different from true [2022-12-14 14:18:01,873 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4248))) (exists ((v_ArrVal_4249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4249)))) is different from true [2022-12-14 14:18:01,883 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4251) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4250)))) is different from true [2022-12-14 14:18:01,930 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4255))) (exists ((v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4254)))) is different from true [2022-12-14 14:18:01,941 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4256) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4257)))) is different from true [2022-12-14 14:18:01,952 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4259))) (exists ((v_ArrVal_4258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4258) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:01,963 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4261))) (exists ((v_ArrVal_4260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4260)))) is different from true [2022-12-14 14:18:02,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4264))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4265) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:02,013 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4266) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4267)))) is different from true [2022-12-14 14:18:02,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4271))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4270) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:02,063 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4272))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4273) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,074 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4275))) (exists ((v_ArrVal_4274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4274) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 14:18:02,085 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4277) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4276)))) is different from true [2022-12-14 14:18:02,095 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4279 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4279) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4278)))) is different from true [2022-12-14 14:18:02,106 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4280))) (exists ((v_ArrVal_4281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4281) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,118 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4283) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4282)))) is different from true [2022-12-14 14:18:02,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4284) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:02,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4286) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4287) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:02,152 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4288))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4289) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,163 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4291 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4291) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4290) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,173 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4293) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4292)))) is different from true [2022-12-14 14:18:02,184 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4295))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4294) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,194 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4297))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4296)))) is different from true [2022-12-14 14:18:02,204 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4298))) (exists ((v_ArrVal_4299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4299)))) is different from true [2022-12-14 14:18:02,215 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4301)))) is different from true [2022-12-14 14:18:02,225 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4303))) (exists ((v_ArrVal_4302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4302)))) is different from true [2022-12-14 14:18:02,236 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4305))) (exists ((v_ArrVal_4304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4304)))) is different from true [2022-12-14 14:18:02,247 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4306))) (exists ((v_ArrVal_4307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4307) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,258 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4308) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4309) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:02,269 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4311))) (exists ((v_ArrVal_4310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4310)))) is different from true [2022-12-14 14:18:02,280 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4313))) (exists ((v_ArrVal_4312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4312)))) is different from true [2022-12-14 14:18:02,291 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4315) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4314)))) is different from true [2022-12-14 14:18:02,302 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4316))) (exists ((v_ArrVal_4317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4317) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,312 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4318 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4318))) (exists ((v_ArrVal_4319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4319) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,323 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4320) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4321) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:02,333 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4323))) (exists ((v_ArrVal_4322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4322) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:02,351 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4324 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4324))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4325)))) is different from true [2022-12-14 14:18:02,362 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4327))) (exists ((v_ArrVal_4326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4326) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:02,373 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4329)))) is different from true [2022-12-14 14:18:02,383 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_4331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4331))) (exists ((v_ArrVal_4330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4330)))) is different from true [2022-12-14 14:18:02,420 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:18:02,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:18:02,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:18:02,524 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:18:02,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:18:02,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:18:02,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 14:18:02,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 14:18:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-12-14 14:18:02,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:18:02,722 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-12-14 14:18:02,756 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 14:18:03,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4424) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4425) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4425))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4424) .cse2 v_ArrVal_4333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 14:18:03,476 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:18:03,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253200558] [2022-12-14 14:18:03,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253200558] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:18:03,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [196331137] [2022-12-14 14:18:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:18:03,477 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:18:03,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:18:03,478 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:18:03,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-12-14 14:18:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:18:07,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 14:18:07,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:18:07,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:18:07,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:18:07,374 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:18:07,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-14 14:18:07,392 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:18:07,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:18:07,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:18:07,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:18:07,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-14 14:18:07,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 14:18:10,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:18:10,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:18:10,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:18:10,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-12-14 14:18:10,296 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 14:18:10,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-12-14 14:18:10,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-14 14:18:10,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-14 14:18:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-12-14 14:18:10,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:18:10,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 159 [2022-12-14 14:18:13,234 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4839 (_ BitVec 32)) (v_arrayElimCell_60 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4887))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse1 (select |c_#length| v_arrayElimCell_60))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (bvule (bvadd (_ bv8 32) (select (select (store .cse2 v_arrayElimCell_60 (store (select .cse2 v_arrayElimCell_60) (bvadd (_ bv16 32) .cse0) v_ArrVal_4839)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse1))))) (forall ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_60 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4887))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse4 (select (select (store .cse5 v_arrayElimCell_60 (store (select .cse5 v_arrayElimCell_60) (bvadd (_ bv16 32) .cse6) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse4) (bvadd (_ bv8 32) .cse4)))) (not (bvule (bvadd .cse6 (_ bv20 32)) (select |c_#length| v_arrayElimCell_60))))))))) is different from false [2022-12-14 14:18:13,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [196331137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:18:13,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769073755] [2022-12-14 14:18:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:18:13,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:18:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:18:13,252 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:18:13,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 14:18:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:18:13,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-14 14:18:13,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:18:13,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:18:13,847 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:18:13,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:18:13,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:18:13,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:18:13,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:18:13,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 14:18:13,968 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254))) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253)))) is different from true [2022-12-14 14:18:14,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,014 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5259))) (exists ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5260) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5262) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5261)))) is different from true [2022-12-14 14:18:14,033 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5263) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264)))) is different from true [2022-12-14 14:18:14,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,053 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268)))) is different from true [2022-12-14 14:18:14,063 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270)))) is different from true [2022-12-14 14:18:14,073 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_5272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5272)))) is different from true [2022-12-14 14:18:14,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5273))) (exists ((v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5274) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,098 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5275 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5275) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276)))) is different from true [2022-12-14 14:18:14,109 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5278))) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 14:18:14,119 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5279))) (exists ((v_ArrVal_5280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5280)))) is different from true [2022-12-14 14:18:14,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5282) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5281) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:14,139 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5283 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5283)))) is different from true [2022-12-14 14:18:14,149 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5286))) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:14,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5287))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5288) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:14,167 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5290) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5289) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,176 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5292) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5291)))) is different from true [2022-12-14 14:18:14,185 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5294) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5293)))) is different from true [2022-12-14 14:18:14,195 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5296))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5295)))) is different from true [2022-12-14 14:18:14,206 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5297))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:14,215 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5300 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5300))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:14,224 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5301))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5302)))) is different from true [2022-12-14 14:18:14,232 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5303))) (exists ((v_ArrVal_5304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5304)))) is different from true [2022-12-14 14:18:14,242 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5305) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,253 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307)))) is different from true [2022-12-14 14:18:14,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5310)))) is different from true [2022-12-14 14:18:14,273 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5311) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5312) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 14:18:14,283 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314))) (exists ((v_ArrVal_5313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5313)))) is different from true [2022-12-14 14:18:14,293 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 14:18:14,303 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5318) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,313 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5319) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5320)))) is different from true [2022-12-14 14:18:14,323 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5322))) (exists ((v_ArrVal_5321 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5321)))) is different from true [2022-12-14 14:18:14,331 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5323 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5323))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:18:14,341 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5326 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5326)))) is different from true [2022-12-14 14:18:14,350 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5328))) (exists ((v_ArrVal_5327 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5327)))) is different from true [2022-12-14 14:18:14,360 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5329))) (exists ((v_ArrVal_5330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5330) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,368 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5332 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5332))) (exists ((v_ArrVal_5331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5331) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:18:14,381 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5334) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5333 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5333)))) is different from true [2022-12-14 14:18:14,390 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5336) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5335)))) is different from true [2022-12-14 14:18:14,401 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32))) (exists ((v_ArrVal_5337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5337))) (exists ((v_ArrVal_5338 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5338)))) is different from true [2022-12-14 14:18:14,411 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5340 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5340))) (exists ((v_ArrVal_5339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5339))) (exists ((v_arrayElimCell_42 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_42) (_ bv44 32)))) is different from true [2022-12-14 14:18:14,447 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:18:14,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:18:14,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:18:14,516 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:18:14,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:18:14,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:18:14,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 14:18:14,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 14:18:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-12-14 14:18:14,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:18:14,618 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-12-14 14:18:14,653 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5342 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5342) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5341 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-14 14:18:16,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769073755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:18:16,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:18:16,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 11, 53] total 104 [2022-12-14 14:18:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653720954] [2022-12-14 14:18:16,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:18:16,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-12-14 14:18:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:18:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-12-14 14:18:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=618, Unknown=138, NotChecked=12330, Total=13340 [2022-12-14 14:18:16,502 INFO L87 Difference]: Start difference. First operand 1794 states and 1968 transitions. Second operand has 105 states, 102 states have (on average 2.4411764705882355) internal successors, (249), 105 states have internal predecessors, (249), 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-12-14 14:18:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:18:53,810 INFO L93 Difference]: Finished difference Result 2615 states and 2818 transitions. [2022-12-14 14:18:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:18:53,811 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 102 states have (on average 2.4411764705882355) internal successors, (249), 105 states have internal predecessors, (249), 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 113 [2022-12-14 14:18:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:18:53,815 INFO L225 Difference]: With dead ends: 2615 [2022-12-14 14:18:53,815 INFO L226 Difference]: Without dead ends: 2615 [2022-12-14 14:18:53,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 194 SyntacticMatches, 51 SemanticMatches, 124 ConstructedPredicates, 90 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=362, Invalid=1089, Unknown=169, NotChecked=14130, Total=15750 [2022-12-14 14:18:53,817 INFO L413 NwaCegarLoop]: 841 mSDtfsCounter, 3606 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 13698 mSolverCounterSat, 63 mSolverCounterUnsat, 1524 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3611 SdHoareTripleChecker+Valid, 8881 SdHoareTripleChecker+Invalid, 153878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 13698 IncrementalHoareTripleChecker+Invalid, 1524 IncrementalHoareTripleChecker+Unknown, 138593 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:18:53,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3611 Valid, 8881 Invalid, 153878 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 13698 Invalid, 1524 Unknown, 138593 Unchecked, 35.3s Time] [2022-12-14 14:18:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2022-12-14 14:18:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 1793. [2022-12-14 14:18:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1097 states have (on average 1.7711941659070192) internal successors, (1943), 1782 states have internal predecessors, (1943), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 14:18:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 1967 transitions. [2022-12-14 14:18:53,842 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 1967 transitions. Word has length 113 [2022-12-14 14:18:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:18:53,843 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 1967 transitions. [2022-12-14 14:18:53,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 102 states have (on average 2.4411764705882355) internal successors, (249), 105 states have internal predecessors, (249), 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-12-14 14:18:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 1967 transitions. [2022-12-14 14:18:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 14:18:53,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:18:53,844 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:18:53,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-12-14 14:18:54,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 14:18:54,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-12-14 14:18:54,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:18:54,446 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:18:54,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:18:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -729759675, now seen corresponding path program 1 times [2022-12-14 14:18:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:18:54,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325653509] [2022-12-14 14:18:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:18:54,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:18:54,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:18:54,454 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:18:54,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-12-14 14:18:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:18:55,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 14:18:55,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:18:55,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:18:55,439 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 14:18:55,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 14:18:55,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:18:55,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 14:18:56,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829)))) is different from true [2022-12-14 14:18:56,696 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-12-14 14:18:56,965 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:18:56,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:18:57,051 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:18:57,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:18:57,116 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:18:57,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:18:57,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 14:18:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-12-14 14:18:57,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:18:57,212 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5859) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-12-14 14:18:57,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5859 (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_5859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 14:18:57,241 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5858))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 14:18:57,254 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5858))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 14:18:57,466 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5905))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5858)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5859)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-14 14:18:57,469 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:18:57,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325653509] [2022-12-14 14:18:57,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325653509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:18:57,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1594369417] [2022-12-14 14:18:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:18:57,469 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:18:57,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:18:57,470 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:18:57,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-12-14 14:19:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:22,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 14:19:22,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:19:22,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:19:23,042 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 14:19:23,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 14:19:23,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:19:23,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 14:19:23,329 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6289) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:24,484 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_6328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6328) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:24,534 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:24,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:19:24,610 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:24,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:19:24,665 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:24,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:19:24,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 14:19:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-12-14 14:19:24,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:19:26,774 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (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_6330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-12-14 14:19:26,791 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 14:19:26,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 14:19:27,073 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6376 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6376))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 14:19:27,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1594369417] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:19:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87759391] [2022-12-14 14:19:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:27,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:19:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:19:27,078 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:19:27,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 14:19:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:27,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 14:19:27,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:19:27,667 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:19:27,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:19:27,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:19:27,830 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6754))) is different from true [2022-12-14 14:19:27,835 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6755 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6755))) is different from true [2022-12-14 14:19:27,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6756) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,843 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6757) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,847 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6758))) is different from true [2022-12-14 14:19:27,851 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6759))) is different from true [2022-12-14 14:19:27,858 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6760) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,863 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6761))) is different from true [2022-12-14 14:19:27,868 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6762 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6762))) is different from true [2022-12-14 14:19:27,872 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6763) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,876 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6764))) is different from true [2022-12-14 14:19:27,880 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6765 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6765) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,885 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6766))) is different from true [2022-12-14 14:19:27,890 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6767) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,894 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6768 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6768))) is different from true [2022-12-14 14:19:27,899 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6769))) is different from true [2022-12-14 14:19:27,903 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6770) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,908 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6771 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6771))) is different from true [2022-12-14 14:19:27,912 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6772))) is different from true [2022-12-14 14:19:27,916 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6773))) is different from true [2022-12-14 14:19:27,923 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6774 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6774))) is different from true [2022-12-14 14:19:27,931 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6775) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,935 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6776) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,939 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6777))) is different from true [2022-12-14 14:19:27,943 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6778))) is different from true [2022-12-14 14:19:27,947 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6779) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,950 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6780) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,956 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6781))) is different from true [2022-12-14 14:19:27,960 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6782))) is different from true [2022-12-14 14:19:27,963 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6783))) is different from true [2022-12-14 14:19:27,969 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6784))) is different from true [2022-12-14 14:19:27,974 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6785 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6785))) is different from true [2022-12-14 14:19:27,979 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6786))) is different from true [2022-12-14 14:19:27,984 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6787) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,989 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6788) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:27,994 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6789))) is different from true [2022-12-14 14:19:27,999 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6790))) is different from true [2022-12-14 14:19:28,004 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6791) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:28,009 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6792))) is different from true [2022-12-14 14:19:28,013 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6793))) is different from true [2022-12-14 14:19:28,018 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6794) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:28,022 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6795))) is different from true [2022-12-14 14:19:28,027 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6796 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6796))) is different from true [2022-12-14 14:19:28,033 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6797) |c_#memory_$Pointer$.base|)) is different from true [2022-12-14 14:19:28,053 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:28,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 14:19:28,120 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:28,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 14:19:28,197 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:28,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 14:19:28,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-14 14:19:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 14:19:28,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:19:28,295 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 14:19:28,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 14:19:28,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (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))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-12-14 14:19:28,401 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6798)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-12-14 14:19:28,412 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6798))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-12-14 14:19:28,635 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6845))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6798)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2022-12-14 14:19:28,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87759391] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:19:28,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:19:28,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 55] total 67 [2022-12-14 14:19:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37504753] [2022-12-14 14:19:28,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:19:28,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-14 14:19:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:19:28,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-14 14:19:28,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=461, Unknown=90, NotChecked=6222, Total=6972 [2022-12-14 14:19:28,644 INFO L87 Difference]: Start difference. First operand 1793 states and 1967 transitions. Second operand has 68 states, 65 states have (on average 2.6) internal successors, (169), 68 states have internal predecessors, (169), 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-12-14 14:19:29,821 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_6754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6754)))) is different from true [2022-12-14 14:19:29,886 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6756) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_6289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_6328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6328) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-12-14 14:19:29,891 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6757) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_73 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_73 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (select |c_#valid| v_arrayElimCell_73) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_5814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5814))) (exists ((v_ArrVal_6289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5829))) (exists ((v_ArrVal_6328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6328) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5850)))) is different from true [2022-12-14 14:19:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:19:53,188 INFO L93 Difference]: Finished difference Result 2827 states and 3090 transitions. [2022-12-14 14:19:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-14 14:19:53,189 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 2.6) internal successors, (169), 68 states have internal predecessors, (169), 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 116 [2022-12-14 14:19:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:19:53,192 INFO L225 Difference]: With dead ends: 2827 [2022-12-14 14:19:53,193 INFO L226 Difference]: Without dead ends: 2827 [2022-12-14 14:19:53,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 207 SyntacticMatches, 89 SemanticMatches, 94 ConstructedPredicates, 64 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=296, Invalid=850, Unknown=102, NotChecked=7872, Total=9120 [2022-12-14 14:19:53,194 INFO L413 NwaCegarLoop]: 1095 mSDtfsCounter, 3160 mSDsluCounter, 11198 mSDsCounter, 0 mSdLazyCounter, 9802 mSolverCounterSat, 65 mSolverCounterUnsat, 1408 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3173 SdHoareTripleChecker+Valid, 12293 SdHoareTripleChecker+Invalid, 105625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 9802 IncrementalHoareTripleChecker+Invalid, 1408 IncrementalHoareTripleChecker+Unknown, 94350 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:19:53,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3173 Valid, 12293 Invalid, 105625 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 9802 Invalid, 1408 Unknown, 94350 Unchecked, 23.6s Time] [2022-12-14 14:19:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-12-14 14:19:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 1792. [2022-12-14 14:19:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1097 states have (on average 1.7702825888787603) internal successors, (1942), 1781 states have internal predecessors, (1942), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 14:19:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 1966 transitions. [2022-12-14 14:19:53,211 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 1966 transitions. Word has length 116 [2022-12-14 14:19:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:19:53,211 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 1966 transitions. [2022-12-14 14:19:53,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 2.6) internal successors, (169), 68 states have internal predecessors, (169), 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-12-14 14:19:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 1966 transitions. [2022-12-14 14:19:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 14:19:53,212 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:19:53,212 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:19:53,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-12-14 14:19:53,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 14:19:53,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-12-14 14:19:53,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 14:19:53,814 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:19:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:19:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash -729759674, now seen corresponding path program 1 times [2022-12-14 14:19:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:19:53,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242404706] [2022-12-14 14:19:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:53,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:19:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:19:53,819 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:19:53,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-12-14 14:19:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:19:54,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-14 14:19:54,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:19:54,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:19:54,887 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:19:54,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:19:54,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:19:54,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:19:54,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:19:55,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:19:55,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 14:19:55,065 WARN L859 $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_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (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)))) is different from true [2022-12-14 14:19:55,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229))) (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-12-14 14:19:55,085 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7231) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7232) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-12-14 14:19:55,134 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7235) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7236) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,146 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7238))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7237) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,157 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7239)))) is different from true [2022-12-14 14:19:55,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7241) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7242) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:19:55,179 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243))) (exists ((v_ArrVal_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244)))) is different from true [2022-12-14 14:19:55,190 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7246))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7245)))) is different from true [2022-12-14 14:19:55,201 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7248))) (exists ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7247) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,211 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7249)))) is different from true [2022-12-14 14:19:55,222 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7252) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7251)))) is different from true [2022-12-14 14:19:55,233 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7253))) (exists ((v_ArrVal_7254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7254)))) is different from true [2022-12-14 14:19:55,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7255))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7256) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:19:55,260 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7257)))) is different from true [2022-12-14 14:19:55,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7259))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7260) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:19:55,282 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7262) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7261)))) is different from true [2022-12-14 14:19:55,293 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7264))) (exists ((v_ArrVal_7263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7263)))) is different from true [2022-12-14 14:19:55,306 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7266)))) is different from true [2022-12-14 14:19:55,317 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7267) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7268) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,328 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7270))) (exists ((v_ArrVal_7269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7269)))) is different from true [2022-12-14 14:19:55,340 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7271))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7272)))) is different from true [2022-12-14 14:19:55,351 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7274))) (exists ((v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7273) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,362 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7275))) (exists ((v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7276) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,374 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7277) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7278)))) is different from true [2022-12-14 14:19:55,386 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7279))) (exists ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7280)))) is different from true [2022-12-14 14:19:55,399 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7282))) (exists ((v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7281) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,413 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7283) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7284) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,425 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7285))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7286)))) is different from true [2022-12-14 14:19:55,437 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7288))) (exists ((v_ArrVal_7287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7287)))) is different from true [2022-12-14 14:19:55,449 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7289) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7290) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,459 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7291))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7292)))) is different from true [2022-12-14 14:19:55,468 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7293))) (exists ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7294)))) is different from true [2022-12-14 14:19:55,477 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7295))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7296)))) is different from true [2022-12-14 14:19:55,487 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7298))) (exists ((v_ArrVal_7297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7297)))) is different from true [2022-12-14 14:19:55,495 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7300) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7299)))) is different from true [2022-12-14 14:19:55,504 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7302))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7301)))) is different from true [2022-12-14 14:19:55,514 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7304) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7303) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,523 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7305)))) is different from true [2022-12-14 14:19:55,532 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7307)))) is different from true [2022-12-14 14:19:55,541 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7310))) (exists ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7309)))) is different from true [2022-12-14 14:19:55,550 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7311))) (exists ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7312)))) is different from true [2022-12-14 14:19:55,559 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7314))) (exists ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7313) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:19:55,593 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:55,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:19:55,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:19:55,703 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:55,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:19:55,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:19:55,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:19:55,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:19:55,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:19:55,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 14:19:55,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 14:19:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-12-14 14:19:55,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:19:56,022 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7317) |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~mem36#1.base| v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 14:19:56,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 14:19:56,118 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7315) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7316))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7315) .cse2 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 14:19:56,159 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7315) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7316))) (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_7315) .cse3 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-12-14 14:19:56,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7409))) (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~mem33#1.base| v_ArrVal_7410) .cse1 v_ArrVal_7315) (select (select (store .cse2 .cse1 v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7317))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7410 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7409))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7316))) (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~mem33#1.base| v_ArrVal_7410) .cse4 v_ArrVal_7315) .cse5 v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7318) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-12-14 14:19:56,967 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:19:56,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242404706] [2022-12-14 14:19:56,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242404706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:19:56,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1657987534] [2022-12-14 14:19:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:19:56,968 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:19:56,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:19:56,969 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:19:56,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-12-14 14:22:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:22:27,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-14 14:22:27,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:22:27,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 14:22:27,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:22:27,772 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:22:27,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:22:27,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:22:27,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:22:27,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:22:27,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 14:22:27,876 WARN L859 $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_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (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)))) is different from true [2022-12-14 14:22:27,885 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795))) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-12-14 14:22:27,894 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (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_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-12-14 14:22:27,904 WARN L859 $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_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-12-14 14:22:27,913 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-12-14 14:22:27,922 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ 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-12-14 14:22:27,932 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:27,941 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7807))) (exists ((v_ArrVal_7806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7806)))) is different from true [2022-12-14 14:22:27,952 WARN L859 $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_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ 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-12-14 14:22:27,961 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811)))) is different from true [2022-12-14 14:22:27,970 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812)))) is different from true [2022-12-14 14:22:27,978 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814))) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815)))) is different from true [2022-12-14 14:22:27,987 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7816) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7817) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:27,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7819) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7818)))) is different from true [2022-12-14 14:22:28,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821)))) is different from true [2022-12-14 14:22:28,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7823))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7822)))) is different from true [2022-12-14 14:22:28,025 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_ArrVal_7825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7825) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:28,035 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7826))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7827)))) is different from true [2022-12-14 14:22:28,047 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7828) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7829) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:28,058 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7831))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7830) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:28,068 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7832))) (exists ((v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7833)))) is different from true [2022-12-14 14:22:28,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7835) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7834)))) is different from true [2022-12-14 14:22:28,091 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7836))) (exists ((v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7837)))) is different from true [2022-12-14 14:22:28,102 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7838))) (exists ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7839)))) is different from true [2022-12-14 14:22:28,113 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7841))) (exists ((v_ArrVal_7840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7840)))) is different from true [2022-12-14 14:22:28,124 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7842) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7843)))) is different from true [2022-12-14 14:22:28,135 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7845)))) is different from true [2022-12-14 14:22:28,149 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7847))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7846)))) is different from true [2022-12-14 14:22:28,160 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7848))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7849) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:28,172 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7850))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7851)))) is different from true [2022-12-14 14:22:28,183 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7853) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7852 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7852) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:28,192 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7854))) (exists ((v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7855)))) is different from true [2022-12-14 14:22:28,201 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7857)))) is different from true [2022-12-14 14:22:28,210 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7858))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7859)))) is different from true [2022-12-14 14:22:28,219 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7861))) (exists ((v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7860)))) is different from true [2022-12-14 14:22:28,228 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7863))) (exists ((v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7862) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:28,237 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7865) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7864)))) is different from true [2022-12-14 14:22:28,246 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7866))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7867) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:28,254 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7868))) (exists ((v_ArrVal_7869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7869)))) is different from true [2022-12-14 14:22:28,263 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7871))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7870) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:28,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7873) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7872)))) is different from true [2022-12-14 14:22:28,280 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7875) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7874)))) is different from true [2022-12-14 14:22:28,289 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7877) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7876) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:28,298 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7879))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7878) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:28,330 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:22:28,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:22:28,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:22:28,404 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:22:28,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:22:28,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:22:28,464 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:22:28,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:22:28,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:22:28,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 14:22:28,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 14:22:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 14:22:28,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:22:28,551 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7883) |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~mem36#1.base| v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-12-14 14:22:28,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-12-14 14:22:28,633 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7881) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7880))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7881) .cse2 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 14:22:28,679 WARN L837 $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_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7880))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) .cse1 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7881) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2022-12-14 14:22:30,607 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7974))) (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~mem33#1.base| v_ArrVal_7975) .cse1 v_ArrVal_7881) (select (select (store .cse2 .cse1 v_ArrVal_7880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7883))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7974))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7880))) (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~mem33#1.base| v_ArrVal_7975) .cse4 v_ArrVal_7881) .cse5 v_ArrVal_7883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-12-14 14:22:30,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1657987534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:22:30,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256994316] [2022-12-14 14:22:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:22:30,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:22:30,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:22:30,625 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:22:30,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 14:22:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:22:31,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-14 14:22:31,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:22:31,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 14:22:31,398 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:22:31,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:22:31,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:22:31,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:22:31,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:22:31,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 14:22:31,631 WARN L859 $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_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (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|))) is different from true [2022-12-14 14:22:31,650 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ 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-12-14 14:22:31,670 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361)))) is different from true [2022-12-14 14:22:31,689 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363)))) is different from true [2022-12-14 14:22:31,712 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ 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-12-14 14:22:31,735 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366)))) is different from true [2022-12-14 14:22:31,755 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (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_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-12-14 14:22:31,777 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370))) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371)))) is different from true [2022-12-14 14:22:31,800 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372)))) is different from true [2022-12-14 14:22:31,822 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32)))) is different from true [2022-12-14 14:22:31,843 WARN L859 $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_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (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)))) is different from true [2022-12-14 14:22:31,865 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8378) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:31,885 WARN L859 $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_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ 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-12-14 14:22:31,905 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382)))) is different from true [2022-12-14 14:22:31,926 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8385 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8385) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8384 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8384)))) is different from true [2022-12-14 14:22:31,947 WARN L859 $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_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ 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-12-14 14:22:31,968 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:31,994 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,015 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,035 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397))) (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,077 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8398 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8398) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,097 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:32,118 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8402) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8403) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,140 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8404)))) is different from true [2022-12-14 14:22:32,160 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:32,181 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,202 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411)))) is different from true [2022-12-14 14:22:32,223 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8413))) (exists ((v_ArrVal_8412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8412)))) is different from true [2022-12-14 14:22:32,243 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8415) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8414)))) is different from true [2022-12-14 14:22:32,264 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8417))) (exists ((v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8416)))) is different from true [2022-12-14 14:22:32,283 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8419))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8418)))) is different from true [2022-12-14 14:22:32,304 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8421) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8420)))) is different from true [2022-12-14 14:22:32,324 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8423))) (exists ((v_ArrVal_8422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8422)))) is different from true [2022-12-14 14:22:32,345 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8425))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8424) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:32,364 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8426))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8427)))) is different from true [2022-12-14 14:22:32,384 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8428))) (exists ((v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8429) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,404 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8430) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8431)))) is different from true [2022-12-14 14:22:32,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8433) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8432)))) is different from true [2022-12-14 14:22:32,444 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8434))) (exists ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8435)))) is different from true [2022-12-14 14:22:32,464 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8436) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8437)))) is different from true [2022-12-14 14:22:32,483 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8438))) (exists ((v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8439) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,504 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8441) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8440) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:32,524 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8442))) (exists ((v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8443)))) is different from true [2022-12-14 14:22:32,598 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:22:32,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:22:32,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:22:32,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:22:32,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:22:32,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:22:32,819 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:22:32,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 14:22:32,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:22:32,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 14:22:32,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-14 14:22:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-12-14 14:22:32,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:22:32,985 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8447) |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~mem36#1.base| v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 14:22:33,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 14:22:33,098 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8445) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8444))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8445) .cse2 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 14:22:33,156 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8445) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8444))) (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_8445) .cse3 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-12-14 14:22:34,801 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8538))) (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~mem33#1.base| v_ArrVal_8539) .cse1 v_ArrVal_8445) (select (select (store .cse2 .cse1 v_ArrVal_8444) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8447))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8538))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8444))) (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~mem33#1.base| v_ArrVal_8539) .cse4 v_ArrVal_8445) .cse5 v_ArrVal_8447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-12-14 14:22:34,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256994316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:22:34,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:22:34,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 54] total 142 [2022-12-14 14:22:34,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698093199] [2022-12-14 14:22:34,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:22:34,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2022-12-14 14:22:34,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:22:34,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2022-12-14 14:22:34,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=287, Unknown=154, NotChecked=24674, Total=25440 [2022-12-14 14:22:34,822 INFO L87 Difference]: Start difference. First operand 1792 states and 1966 transitions. Second operand has 143 states, 141 states have (on average 1.6382978723404256) internal successors, (231), 143 states have internal predecessors, (231), 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-12-14 14:22:35,918 WARN L859 $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_7234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7234))) (exists ((v_ArrVal_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7233) |c_#memory_$Pointer$.offset|)) (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_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_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (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_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_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)))) is different from true [2022-12-14 14:22:35,924 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7795))) (exists ((v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7235) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7794) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ 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_7229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7229))) (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|)) (exists ((v_ArrVal_7236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7236) |c_#memory_$Pointer$.base|)) (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-12-14 14:22:35,931 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7231) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7232) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7238))) (exists ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8360) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7237) |c_#memory_$Pointer$.base|)) (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_8361 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8361))) (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-12-14 14:22:35,937 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8362 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8362))) (exists ((v_ArrVal_7234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7234))) (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_7233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7233) |c_#memory_$Pointer$.offset|)) (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_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8363 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8363))) (exists ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7239)))) is different from true [2022-12-14 14:22:35,944 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7800))) (exists ((v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7241) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7235) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7801 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7801) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7236 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7236) |c_#memory_$Pointer$.base|)) (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_7242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7242) |c_#memory_$Pointer$.offset|)) (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-12-14 14:22:35,950 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7238))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7237) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243))) (exists ((v_ArrVal_8367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8367))) (exists ((v_ArrVal_8366 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8366))) (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|)) (exists ((v_ArrVal_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244)))) is different from true [2022-12-14 14:22:35,957 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7246))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7804 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7804) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7240) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7239))) (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_7245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7245))) (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_7805 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7805) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:35,964 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7241) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8370 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8370))) (exists ((v_ArrVal_8371 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8371))) (exists ((v_ArrVal_7807 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7807))) (exists ((v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7248))) (exists ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7806 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7806))) (exists ((v_ArrVal_7242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7242) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:35,970 WARN L859 $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_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7243 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7243))) (exists ((v_ArrVal_7250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8373))) (exists ((v_ArrVal_8372 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8372))) (exists ((v_ArrVal_7249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7249))) (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_7244 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7244)))) is different from true [2022-12-14 14:22:35,977 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8374) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7246 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7246))) (exists ((v_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7252) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8375) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7810))) (exists ((v_ArrVal_7251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7251))) (exists ((v_ArrVal_7245 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7245))) (exists ((v_ArrVal_7811 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7811)))) is different from true [2022-12-14 14:22:35,983 WARN L859 $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_7813 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7813))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7253))) (exists ((v_ArrVal_7254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7254))) (exists ((v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7248))) (exists ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7247) |c_#memory_$Pointer$.base|)) (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_7812 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7812)))) is different from true [2022-12-14 14:22:35,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8379 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8379))) (exists ((v_ArrVal_7255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7255))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7814 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7814))) (exists ((v_ArrVal_7250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7250) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8378 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8378) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7815 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7815))) (exists ((v_ArrVal_7249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7249)))) is different from true [2022-12-14 14:22:35,996 WARN L859 $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_ArrVal_7252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7252) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7816) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7251))) (exists ((v_ArrVal_7257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7257))) (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_7817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7817) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:36,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7259))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7819) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7253))) (exists ((v_ArrVal_7254 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7254))) (exists ((v_ArrVal_8383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8383))) (exists ((v_ArrVal_8382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8382))) (exists ((v_ArrVal_7818 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7818)))) is different from true [2022-12-14 14:22:36,010 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7262) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7255))) (exists ((v_ArrVal_8385 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8385) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7820) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8384 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8384))) (exists ((v_ArrVal_7256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7256) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7821 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7821))) (exists ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7261)))) is different from true [2022-12-14 14:22:36,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7823 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7823))) (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_7258 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7258) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7257))) (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7264))) (exists ((v_ArrVal_7263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7263))) (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_7822 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7822)))) is different from true [2022-12-14 14:22:36,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7259))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7260 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7260) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7824 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7824))) (exists ((v_ArrVal_8389 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8389) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7825 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7825) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8388 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8388) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7266)))) is different from true [2022-12-14 14:22:36,029 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7826 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7826))) (exists ((v_ArrVal_7262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7262) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7267) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8390 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8390) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7827))) (exists ((v_ArrVal_7268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7261))) (exists ((v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8391) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:36,036 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7828 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7828) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7829 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7829) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8393) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7264))) (exists ((v_ArrVal_7263 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7263))) (exists ((v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8392) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7270))) (exists ((v_ArrVal_7269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7269)))) is different from true [2022-12-14 14:22:36,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7831 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7831))) (exists ((v_ArrVal_7271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7271))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8394))) (exists ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7272))) (exists ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8395) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7830 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7830) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7266)))) is different from true [2022-12-14 14:22:36,049 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7267) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7274))) (exists ((v_ArrVal_7268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7268) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8397 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8397))) (exists ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8396) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7832 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7832))) (exists ((v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7833)))) is different from true [2022-12-14 14:22:36,056 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8398 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8398) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7275))) (exists ((v_ArrVal_7835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7835) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7270))) (exists ((v_ArrVal_7269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7269))) (exists ((v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7276) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7834 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7834)))) is different from true [2022-12-14 14:22:36,063 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7277) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7271))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7836))) (exists ((v_ArrVal_7837 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7837))) (exists ((v_ArrVal_8400 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8400))) (exists ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7272))) (exists ((v_ArrVal_8401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8401) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7278)))) is different from true [2022-12-14 14:22:36,070 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7274 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7274))) (exists ((v_ArrVal_8402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8402) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7273) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7279))) (exists ((v_ArrVal_8403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8403) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7280))) (exists ((v_ArrVal_7838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7838))) (exists ((v_ArrVal_7839 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7839)))) is different from true [2022-12-14 14:22:36,076 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8405) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7275))) (exists ((v_ArrVal_8404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8404))) (exists ((v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7282))) (exists ((v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7276) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7841 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7841))) (exists ((v_ArrVal_7840 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7840)))) is different from true [2022-12-14 14:22:36,083 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8407))) (exists ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7283) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7277) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7842) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7843 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7843))) (exists ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7284) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7278))) (exists ((v_ArrVal_8406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8406) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:36,089 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7285))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7844) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7845))) (exists ((v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7279))) (exists ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7280))) (exists ((v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8408) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7286))) (exists ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8409) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:36,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7847))) (exists ((v_ArrVal_8410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8410))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8411))) (exists ((v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7288))) (exists ((v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7282))) (exists ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7846))) (exists ((v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7287)))) is different from true [2022-12-14 14:22:36,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7283) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7848))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7289) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7290) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7849) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7284) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8413))) (exists ((v_ArrVal_8412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8412)))) is different from true [2022-12-14 14:22:36,111 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7285))) (exists ((v_ArrVal_7850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7850))) (exists ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7291))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7292))) (exists ((v_ArrVal_7851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7851))) (exists ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8415) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7286))) (exists ((v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8414)))) is different from true [2022-12-14 14:22:36,118 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7853) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8417))) (exists ((v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7288))) (exists ((v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7293))) (exists ((v_ArrVal_8416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8416))) (exists ((v_ArrVal_7852 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7852) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7294))) (exists ((v_ArrVal_7287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7287)))) is different from true [2022-12-14 14:22:36,128 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7295))) (exists ((v_ArrVal_8419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8419))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7296))) (exists ((v_ArrVal_7289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7289) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8418))) (exists ((v_ArrVal_7290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7290) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7854))) (exists ((v_ArrVal_7855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7855)))) is different from true [2022-12-14 14:22:36,135 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7291 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7291))) (exists ((v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7292))) (exists ((v_ArrVal_8421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8421) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7298))) (exists ((v_ArrVal_8420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8420))) (exists ((v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7857))) (exists ((v_ArrVal_7297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7297)))) is different from true [2022-12-14 14:22:36,141 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7858))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8423))) (exists ((v_ArrVal_7300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7300) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7293 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7293))) (exists ((v_ArrVal_8422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8422))) (exists ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7859))) (exists ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7294))) (exists ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7299)))) is different from true [2022-12-14 14:22:36,148 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7302))) (exists ((v_ArrVal_7295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7295))) (exists ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8425))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7296))) (exists ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7861))) (exists ((v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7860))) (exists ((v_ArrVal_7301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7301))) (exists ((v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8424) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:36,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8426))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7304) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7863))) (exists ((v_ArrVal_8427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8427))) (exists ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7298))) (exists ((v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7303) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7297 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7297)))) is different from true [2022-12-14 14:22:36,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8428))) (exists ((v_ArrVal_7300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7300) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7865) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7305))) (exists ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7864))) (exists ((v_ArrVal_8429 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8429) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7299)))) is different from true [2022-12-14 14:22:36,168 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7866))) (exists ((v_ArrVal_7302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7302))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7867) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8430) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7307))) (exists ((v_ArrVal_8431 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8431))) (exists ((v_ArrVal_7301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7301)))) is different from true [2022-12-14 14:22:36,174 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8433) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7868 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7868))) (exists ((v_ArrVal_7304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7304) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7869))) (exists ((v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8432))) (exists ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7310))) (exists ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7309))) (exists ((v_ArrVal_7303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7303) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:36,181 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7871))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7306) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8434))) (exists ((v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7311))) (exists ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7312))) (exists ((v_ArrVal_7305 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7305))) (exists ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8435))) (exists ((v_ArrVal_7870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7870) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:36,188 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7873) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8436) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7314))) (exists ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7313) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8437))) (exists ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7307))) (exists ((v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7872)))) is different from true [2022-12-14 14:22:36,194 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7875) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8438))) (exists ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7874))) (exists ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7310))) (exists ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7309))) (exists ((v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8439) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:22:36,200 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7311))) (exists ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7312))) (exists ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7877) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8441) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8440) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7876) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:22:36,206 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7879))) (exists ((v_arrayElimCell_95 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_95) (_ bv44 32))) (exists ((v_ArrVal_7314 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7314))) (exists ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7313) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8442))) (exists ((v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7878) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_8443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8443)))) is different from true [2022-12-14 14:23:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:13,303 INFO L93 Difference]: Finished difference Result 3437 states and 3709 transitions. [2022-12-14 14:23:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-14 14:23:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 143 states, 141 states have (on average 1.6382978723404256) internal successors, (231), 143 states have internal predecessors, (231), 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 116 [2022-12-14 14:23:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:13,313 INFO L225 Difference]: With dead ends: 3437 [2022-12-14 14:23:13,313 INFO L226 Difference]: Without dead ends: 3437 [2022-12-14 14:23:13,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 212 SyntacticMatches, 5 SemanticMatches, 212 ConstructedPredicates, 190 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=485, Invalid=620, Unknown=207, NotChecked=44270, Total=45582 [2022-12-14 14:23:13,315 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 3033 mSDsluCounter, 5744 mSDsCounter, 0 mSdLazyCounter, 8519 mSolverCounterSat, 37 mSolverCounterUnsat, 931 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 7181 SdHoareTripleChecker+Invalid, 417243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 8519 IncrementalHoareTripleChecker+Invalid, 931 IncrementalHoareTripleChecker+Unknown, 407756 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:13,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 7181 Invalid, 417243 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [37 Valid, 8519 Invalid, 931 Unknown, 407756 Unchecked, 36.3s Time] [2022-12-14 14:23:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2022-12-14 14:23:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 1803. [2022-12-14 14:23:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1107 states have (on average 1.7633242999096657) internal successors, (1952), 1791 states have internal predecessors, (1952), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (14), 8 states have call predecessors, (14), 11 states have call successors, (14) [2022-12-14 14:23:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 1977 transitions. [2022-12-14 14:23:13,333 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 1977 transitions. Word has length 116 [2022-12-14 14:23:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:13,333 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 1977 transitions. [2022-12-14 14:23:13,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 141 states have (on average 1.6382978723404256) internal successors, (231), 143 states have internal predecessors, (231), 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-12-14 14:23:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 1977 transitions. [2022-12-14 14:23:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 14:23:13,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:13,340 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 14:23:13,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-12-14 14:23:13,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 14:23:13,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-12-14 14:23:13,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:23:13,942 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-12-14 14:23:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash -847752346, now seen corresponding path program 2 times [2022-12-14 14:23:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 14:23:13,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774411717] [2022-12-14 14:23:13,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:23:13,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 14:23:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 14:23:13,947 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 14:23:13,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-12-14 14:23:14,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:23:14,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:23:14,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 14:23:14,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:23:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:23:19,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:23:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 181 proven. 899 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:23:38,593 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 14:23:38,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774411717] [2022-12-14 14:23:38,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774411717] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:23:38,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1413509470] [2022-12-14 14:23:38,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:23:38,594 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 14:23:38,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 14:23:38,595 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 14:23:38,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-12-14 14:23:43,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:23:43,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:23:43,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 14:23:43,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:23:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:23:46,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:24:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 90 proven. 990 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:24:05,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1413509470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:24:05,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119530174] [2022-12-14 14:24:05,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 14:24:05,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:24:05,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:24:05,605 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:24:05,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b69b7c07-afc5-47d1-8702-40152ede1916/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 14:24:30,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 14:24:30,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:24:31,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 121 conjunts are in the unsatisfiable core [2022-12-14 14:24:31,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:24:31,871 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 14:24:31,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 14:24:32,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:24:32,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:24:33,743 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9705 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9705) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9706 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9706)))) is different from true [2022-12-14 14:24:33,760 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9708 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9708))) (exists ((v_ArrVal_9707 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9707)))) is different from true [2022-12-14 14:24:33,777 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9710 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9710))) (exists ((v_ArrVal_9709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9709) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:33,795 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9712))) (exists ((v_ArrVal_9711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9711) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:33,812 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9714))) (exists ((v_ArrVal_9713 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9713)))) is different from true [2022-12-14 14:24:33,832 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9716 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9716))) (exists ((v_ArrVal_9715 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9715)))) is different from true [2022-12-14 14:24:33,848 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9717) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9718 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9718)))) is different from true [2022-12-14 14:24:33,865 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9719)))) is different from true [2022-12-14 14:24:33,883 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9722))) (exists ((v_ArrVal_9721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9721) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:33,899 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9723))) (exists ((v_ArrVal_9724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9724)))) is different from true [2022-12-14 14:24:33,917 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9725))) (exists ((v_ArrVal_9726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9726) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:33,935 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9728))) (exists ((v_ArrVal_9727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9727) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:33,952 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9729) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9730 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9730)))) is different from true [2022-12-14 14:24:33,971 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9732))) (exists ((v_ArrVal_9731 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9731)))) is different from true [2022-12-14 14:24:33,990 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9734) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9733) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:34,009 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9736) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9735) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:34,028 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9737 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9737))) (exists ((v_ArrVal_9738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9738)))) is different from true [2022-12-14 14:24:34,046 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9740 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9740) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9739) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:34,063 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9741))) (exists ((v_ArrVal_9742 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9742)))) is different from true [2022-12-14 14:24:34,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9743 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9743))) (exists ((v_ArrVal_9744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9744) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:34,096 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9746))) (exists ((v_ArrVal_9745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9745) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:34,113 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9748 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9748))) (exists ((v_ArrVal_9747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9747)))) is different from true [2022-12-14 14:24:34,129 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9749) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9750 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9750)))) is different from true [2022-12-14 14:24:34,147 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9752))) (exists ((v_ArrVal_9751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9751)))) is different from true [2022-12-14 14:24:34,164 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9753 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9753) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9754)))) is different from true [2022-12-14 14:24:34,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9755 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9755) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9756 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9756)))) is different from true [2022-12-14 14:24:34,198 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9757 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9757))) (exists ((v_ArrVal_9758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9758) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:34,218 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9760))) (exists ((v_ArrVal_9759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9759)))) is different from true [2022-12-14 14:24:34,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9762) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9761 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9761)))) is different from true [2022-12-14 14:24:34,253 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9763) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9764) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:34,270 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9765 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9765))) (exists ((v_ArrVal_9766 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9766) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:34,287 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9767 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9767))) (exists ((v_ArrVal_9768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9768) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:34,304 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9769))) (exists ((v_ArrVal_9770 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9770)))) is different from true [2022-12-14 14:24:34,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9771 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9771) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9772 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9772)))) is different from true [2022-12-14 14:24:34,337 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9773 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9773))) (exists ((v_ArrVal_9774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9774) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:34,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9776)))) is different from true [2022-12-14 14:24:34,371 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9777 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9777))) (exists ((v_ArrVal_9778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9778) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:34,390 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9779 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9779) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9780)))) is different from true [2022-12-14 14:24:34,412 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9781))) (exists ((v_ArrVal_9782 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9782)))) is different from true [2022-12-14 14:24:34,429 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9783 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9783))) (exists ((v_ArrVal_9784 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9784)))) is different from true [2022-12-14 14:24:34,446 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9785 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9785))) (exists ((v_ArrVal_9786 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9786)))) is different from true [2022-12-14 14:24:34,463 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9787) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9788) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-14 14:24:34,480 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9789 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9789))) (exists ((v_ArrVal_9790 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9790)))) is different from true [2022-12-14 14:24:34,496 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9791 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9791))) (exists ((v_ArrVal_9792 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9792)))) is different from true [2022-12-14 14:24:34,515 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9794))) (exists ((v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9793)))) is different from true [2022-12-14 14:24:34,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9795 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9795))) (exists ((v_ArrVal_9796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9796) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 14:24:34,595 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:24:34,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 14:24:34,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 14:24:35,214 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:24:35,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-12-14 14:24:35,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-12-14 14:24:36,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:24:36,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 70 [2022-12-14 14:24:36,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-12-14 14:24:36,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-12-14 14:24:36,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-12-14 14:24:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1081 not checked. [2022-12-14 14:24:36,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:24:40,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:24:40,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 182 [2022-12-14 14:24:45,003 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (bvadd |c_ULTIMATE.start_main_#t~mem35#1.offset| (_ bv20 32))) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse0) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse0 v_ArrVal_9800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32)))) (= .cse0 (select (select (store .cse3 .cse0 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (select (select (store .cse6 .cse5 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse4) (= (_ bv0 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse5 v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32))) (= .cse5 .cse4)))))) (forall ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse7) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse7 v_ArrVal_9800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse8 (_ bv8 32)) (bvadd .cse8 (_ bv12 32))))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| (select (select (store .cse9 .cse10 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse10) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797))) (bvule (bvadd (select (select (store .cse11 .cse10 v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (bvadd (_ bv8 32) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse12) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse12 v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) .cse13) (= .cse12 (select (select (store .cse14 .cse12 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797)) (.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse15 (bvadd (select (select (store .cse16 .cse17 v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)))) (or (bvule .cse15 .cse13) (bvule .cse15 (bvadd (_ bv8 32) (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse17 (select (select (store .cse18 .cse17 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) (forall ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| (select (select (store .cse19 .cse20 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse20) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse20 v_ArrVal_9800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse21 (_ bv8 32)) (bvadd .cse21 (_ bv12 32)))))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797)) (.cse22 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse23 (bvadd (select (select (store .cse24 .cse22 v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse22) (bvule .cse23 .cse13) (bvule .cse23 (bvadd (_ bv8 32) (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse25 (select (select (store .cse27 .cse26 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse25) (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse26) (= (_ bv0 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse26 v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32))) (= .cse26 .cse25)))))) (forall ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse28 (select (select (store .cse31 .cse30 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse28) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse30 v_ArrVal_9800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse29 (_ bv8 32)) (bvadd .cse29 (_ bv12 32)))) (= .cse30 .cse28)))))) (forall ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse33 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse32 (select (select (store .cse35 .cse33 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse32) (= |c_ULTIMATE.start_main_#t~mem35#1.base| .cse33) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse33 v_ArrVal_9800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse34 (_ bv8 32)) (bvadd .cse34 (_ bv12 32)))) (= .cse33 .cse32)))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797))) (let ((.cse36 (bvadd (select (select (store .cse37 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)))) (or (bvule .cse36 .cse13) (bvule .cse36 (bvadd (_ bv8 32) (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) (forall ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse38 (_ bv8 32)) (bvadd .cse38 (_ bv12 32))))) (forall ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9798))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9797) .cse40 v_ArrVal_9800) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse39 (_ bv8 32)) (bvadd .cse39 (_ bv12 32)))) (= .cse40 (select (select (store .cse41 .cse40 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) is different from true [2022-12-14 14:27:19,195 WARN L233 SmtUtils]: Spent 9.71s on a formula simplification. DAG size of input: 60 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:27:22,624 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9895 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9896))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9895)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse1 (store .cse3 .cse5 v_ArrVal_9797))) (let ((.cse0 (bvadd (select (select (store .cse1 (select (select (store .cse4 .cse5 v_ArrVal_9798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)))) (or (bvule .cse0 (bvadd (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32))) (bvule .cse0 (bvadd (_ bv20 32) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9895 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9896))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (select (select (store .cse9 .cse8 v_ArrVal_9798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9895) .cse8 v_ArrVal_9797))) (bvule (bvadd (select (select (store .cse6 .cse7 v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (bvadd (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)))) (= .cse8 .cse7)))))) (forall ((v_prenex_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9895 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9896))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_9798))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9895) .cse10 v_ArrVal_9797) .cse11 v_prenex_27) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (_ bv0 32)) (= (select (select (store .cse12 .cse11 v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse11))))))) (forall ((v_ArrVal_9800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9895 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9896))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9895) .cse15 v_ArrVal_9797) (select (select (store .cse16 .cse15 v_ArrVal_9798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9800))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse14) (bvadd .cse14 (_ bv12 32))))))) is different from false [2022-12-14 14:27:23,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119530174] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:27:23,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 14:27:23,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48, 48, 57] total 207 [2022-12-14 14:27:23,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963404864] [2022-12-14 14:27:23,178 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 14:27:23,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 207 states [2022-12-14 14:27:23,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 14:27:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2022-12-14 14:27:23,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4331, Invalid=23188, Unknown=63, NotChecked=18000, Total=45582 [2022-12-14 14:27:23,182 INFO L87 Difference]: Start difference. First operand 1803 states and 1977 transitions. Second operand has 207 states, 206 states have (on average 1.6116504854368932) internal successors, (332), 207 states have internal predecessors, (332), 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)