./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- 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-4e7fbc6 [2022-11-23 02:41:48,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:41:48,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:41:48,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:41:48,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:41:48,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:41:48,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:41:48,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:41:48,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:41:48,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:41:48,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:41:48,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:41:48,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:41:48,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:41:48,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:41:48,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:41:48,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:41:48,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:41:48,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:41:48,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:41:48,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:41:48,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:41:48,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:41:48,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:41:48,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:41:48,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:41:48,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:41:48,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:41:48,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:41:48,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:41:48,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:41:48,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:41:48,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:41:48,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:41:48,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:41:48,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:41:48,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:41:48,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:41:48,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:41:48,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:41:48,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:41:48,393 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 02:41:48,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:41:48,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:41:48,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:41:48,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:41:48,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:41:48,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:41:48,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:41:48,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:41:48,443 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:41:48,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:41:48,445 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:41:48,445 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:41:48,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:41:48,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:41:48,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:41:48,446 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:41:48,446 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:41:48,447 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:41:48,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:41:48,447 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:41:48,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:41:48,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:41:48,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:41:48,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:41:48,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:41:48,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:41:48,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:41:48,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:41:48,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:41:48,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:41:48,451 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:41:48,451 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:41:48,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:41:48,451 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2022-11-23 02:41:48,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:41:48,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:41:48,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:41:48,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:41:48,870 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:41:48,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2022-11-23 02:41:52,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:41:52,466 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:41:52,467 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2022-11-23 02:41:52,493 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/data/613c0272f/618ab1cd80774038ae4eda544bec33c3/FLAG137f31f57 [2022-11-23 02:41:52,513 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/data/613c0272f/618ab1cd80774038ae4eda544bec33c3 [2022-11-23 02:41:52,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:41:52,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:41:52,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:41:52,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:41:52,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:41:52,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:52" (1/1) ... [2022-11-23 02:41:52,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de050d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:52, skipping insertion in model container [2022-11-23 02:41:52,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:52" (1/1) ... [2022-11-23 02:41:52,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:41:52,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:41:53,371 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_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i[33021,33034] [2022-11-23 02:41:53,498 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_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i[49681,49694] [2022-11-23 02:41:53,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:41:53,521 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-23 02:41:53,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@40fdcd9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:53, skipping insertion in model container [2022-11-23 02:41:53,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:41:53,523 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-23 02:41:53,525 INFO L158 Benchmark]: Toolchain (without parser) took 1005.19ms. Allocated memory is still 190.8MB. Free memory was 153.2MB in the beginning and 145.5MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 02:41:53,526 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:41:53,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 996.38ms. Allocated memory is still 190.8MB. Free memory was 153.2MB in the beginning and 145.5MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 02:41:53,528 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.31ms. Allocated memory is still 123.7MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 996.38ms. Allocated memory is still 190.8MB. Free memory was 153.2MB in the beginning and 145.5MB in the end (delta: 7.7MB). Peak memory consumption was 6.3MB. 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- 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-4e7fbc6 [2022-11-23 02:41:56,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:41:56,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:41:56,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:41:56,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:41:56,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:41:56,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:41:56,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:41:56,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:41:56,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:41:56,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:41:56,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:41:56,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:41:56,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:41:56,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:41:56,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:41:56,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:41:56,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:41:56,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:41:56,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:41:56,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:41:56,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:41:56,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:41:56,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:41:56,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:41:56,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:41:56,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:41:56,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:41:56,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:41:56,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:41:56,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:41:56,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:41:56,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:41:56,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:41:56,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:41:56,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:41:56,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:41:56,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:41:56,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:41:56,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:41:56,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:41:56,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 02:41:56,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:41:56,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:41:56,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:41:56,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:41:56,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:41:56,577 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:41:56,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:41:56,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:41:56,578 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:41:56,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:41:56,579 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:41:56,579 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:41:56,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:41:56,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:41:56,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:41:56,580 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:41:56,580 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:41:56,580 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:41:56,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:41:56,581 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:41:56,581 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 02:41:56,581 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 02:41:56,582 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:41:56,582 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:41:56,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:41:56,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:41:56,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:41:56,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:41:56,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:41:56,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:41:56,590 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 02:41:56,591 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 02:41:56,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:41:56,591 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:41:56,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:41:56,592 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 02:41:56,593 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2022-11-23 02:41:57,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:41:57,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:41:57,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:41:57,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:41:57,071 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:41:57,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2022-11-23 02:42:00,486 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:42:00,994 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:42:00,996 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2022-11-23 02:42:01,019 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/data/c6e94fd04/03c4d6f1879640ddb4a0594120340be7/FLAGe0a7cd75c [2022-11-23 02:42:01,049 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/data/c6e94fd04/03c4d6f1879640ddb4a0594120340be7 [2022-11-23 02:42:01,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:42:01,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:42:01,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:42:01,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:42:01,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:42:01,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:42:01" (1/1) ... [2022-11-23 02:42:01,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4859a190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:01, skipping insertion in model container [2022-11-23 02:42:01,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:42:01" (1/1) ... [2022-11-23 02:42:01,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:42:01,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:42:01,621 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_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i[33021,33034] [2022-11-23 02:42:01,771 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_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i[49681,49694] [2022-11-23 02:42:01,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:42:01,795 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 02:42:01,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:42:01,829 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_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i[33021,33034] [2022-11-23 02:42:01,966 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_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i[49681,49694] [2022-11-23 02:42:01,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:42:01,987 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:42:02,029 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_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i[33021,33034] [2022-11-23 02:42:02,153 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_559ef90d-06c4-402e-9973-949c4d67f4f3/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i[49681,49694] [2022-11-23 02:42:02,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:42:02,211 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:42:02,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02 WrapperNode [2022-11-23 02:42:02,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:42:02,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:42:02,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:42:02,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:42:02,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,359 INFO L138 Inliner]: procedures = 180, calls = 388, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1406 [2022-11-23 02:42:02,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:42:02,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:42:02,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:42:02,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:42:02,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,504 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:42:02,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:42:02,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:42:02,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:42:02,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (1/1) ... [2022-11-23 02:42:02,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:42:02,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:42:02,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:42:02,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:42:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-23 02:42:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 02:42:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 02:42:02,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 02:42:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-23 02:42:02,642 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-23 02:42:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 02:42:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:42:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 02:42:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:42:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-23 02:42:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 02:42:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:42:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 02:42:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 02:42:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:42:02,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:42:02,983 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:42:02,985 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:42:02,995 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-23 02:42:10,783 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:42:10,805 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:42:10,806 INFO L300 CfgBuilder]: Removed 83 assume(true) statements. [2022-11-23 02:42:10,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:10 BoogieIcfgContainer [2022-11-23 02:42:10,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:42:10,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:42:10,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:42:10,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:42:10,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:42:01" (1/3) ... [2022-11-23 02:42:10,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67283485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:42:10, skipping insertion in model container [2022-11-23 02:42:10,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:42:02" (2/3) ... [2022-11-23 02:42:10,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67283485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:42:10, skipping insertion in model container [2022-11-23 02:42:10,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:42:10" (3/3) ... [2022-11-23 02:42:10,838 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-1.i [2022-11-23 02:42:10,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:42:10,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 729 error locations. [2022-11-23 02:42:11,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:42:11,027 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33dc2ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:42:11,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 729 error locations. [2022-11-23 02:42:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 1454 states, 717 states have (on average 2.2384937238493725) internal successors, (1605), 1445 states have internal predecessors, (1605), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 02:42:11,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:11,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:42:11,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-11-23 02:42:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:11,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101018360] [2022-11-23 02:42:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:11,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:11,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:11,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:11,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 02:42:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:11,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 02:42:11,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:11,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:11,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:11,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101018360] [2022-11-23 02:42:11,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101018360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:11,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:11,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:42:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82637188] [2022-11-23 02:42:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:11,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:42:11,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:42:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:42:11,394 INFO L87 Difference]: Start difference. First operand has 1454 states, 717 states have (on average 2.2384937238493725) internal successors, (1605), 1445 states have internal predecessors, (1605), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:11,529 INFO L93 Difference]: Finished difference Result 1436 states and 1517 transitions. [2022-11-23 02:42:11,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:42:11,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 02:42:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:11,576 INFO L225 Difference]: With dead ends: 1436 [2022-11-23 02:42:11,577 INFO L226 Difference]: Without dead ends: 1434 [2022-11-23 02:42:11,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:42:11,587 INFO L413 NwaCegarLoop]: 1517 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, 1517 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:11,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:42:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2022-11-23 02:42:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2022-11-23 02:42:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 708 states have (on average 2.1087570621468927) internal successors, (1493), 1425 states have internal predecessors, (1493), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1515 transitions. [2022-11-23 02:42:11,810 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1515 transitions. Word has length 5 [2022-11-23 02:42:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:11,811 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1515 transitions. [2022-11-23 02:42:11,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1515 transitions. [2022-11-23 02:42:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 02:42:11,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:11,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:42:11,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:12,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:12,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:12,032 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-11-23 02:42:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:12,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990420124] [2022-11-23 02:42:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:12,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:12,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:12,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:12,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 02:42:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:12,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:42:12,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:12,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:42:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:12,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:12,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:12,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990420124] [2022-11-23 02:42:12,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990420124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:12,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:12,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:42:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804147249] [2022-11-23 02:42:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:12,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:42:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:12,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:42:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:12,400 INFO L87 Difference]: Start difference. First operand 1434 states and 1515 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:16,636 INFO L93 Difference]: Finished difference Result 1690 states and 1814 transitions. [2022-11-23 02:42:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:42:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 02:42:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:16,650 INFO L225 Difference]: With dead ends: 1690 [2022-11-23 02:42:16,650 INFO L226 Difference]: Without dead ends: 1690 [2022-11-23 02:42:16,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:16,657 INFO L413 NwaCegarLoop]: 953 mSDtfsCounter, 1365 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:16,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1217 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-23 02:42:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2022-11-23 02:42:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1419. [2022-11-23 02:42:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 784 states have (on average 1.9604591836734695) internal successors, (1537), 1410 states have internal predecessors, (1537), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1559 transitions. [2022-11-23 02:42:16,710 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1559 transitions. Word has length 5 [2022-11-23 02:42:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:16,710 INFO L495 AbstractCegarLoop]: Abstraction has 1419 states and 1559 transitions. [2022-11-23 02:42:16,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1559 transitions. [2022-11-23 02:42:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 02:42:16,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:16,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:42:16,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:16,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:16,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-11-23 02:42:16,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:16,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700240214] [2022-11-23 02:42:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:16,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:16,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:16,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:16,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 02:42:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:17,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 02:42:17,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:17,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:42:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:17,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:17,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:17,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700240214] [2022-11-23 02:42:17,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700240214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:17,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:17,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:42:17,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120681671] [2022-11-23 02:42:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:17,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:42:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:17,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:42:17,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:17,167 INFO L87 Difference]: Start difference. First operand 1419 states and 1559 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:23,049 INFO L93 Difference]: Finished difference Result 1941 states and 2130 transitions. [2022-11-23 02:42:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:42:23,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 02:42:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:23,059 INFO L225 Difference]: With dead ends: 1941 [2022-11-23 02:42:23,059 INFO L226 Difference]: Without dead ends: 1941 [2022-11-23 02:42:23,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:23,061 INFO L413 NwaCegarLoop]: 1347 mSDtfsCounter, 743 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:23,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1948 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-23 02:42:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2022-11-23 02:42:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1575. [2022-11-23 02:42:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 950 states have (on average 1.94) internal successors, (1843), 1566 states have internal predecessors, (1843), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1865 transitions. [2022-11-23 02:42:23,101 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1865 transitions. Word has length 5 [2022-11-23 02:42:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:23,102 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 1865 transitions. [2022-11-23 02:42:23,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1865 transitions. [2022-11-23 02:42:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 02:42:23,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:23,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 02:42:23,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:23,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:23,314 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1157590079, now seen corresponding path program 1 times [2022-11-23 02:42:23,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:23,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876488208] [2022-11-23 02:42:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:23,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:23,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:23,318 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:23,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 02:42:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:23,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 02:42:23,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:23,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:23,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:23,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876488208] [2022-11-23 02:42:23,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876488208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:23,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:23,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429190434] [2022-11-23 02:42:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:23,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:42:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:42:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:23,513 INFO L87 Difference]: Start difference. First operand 1575 states and 1865 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:23,699 INFO L93 Difference]: Finished difference Result 3133 states and 3713 transitions. [2022-11-23 02:42:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:42:23,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 02:42:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:23,714 INFO L225 Difference]: With dead ends: 3133 [2022-11-23 02:42:23,714 INFO L226 Difference]: Without dead ends: 3133 [2022-11-23 02:42:23,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:23,716 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 1373 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:23,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 2877 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:42:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2022-11-23 02:42:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1577. [2022-11-23 02:42:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 952 states have (on average 1.9380252100840336) internal successors, (1845), 1568 states have internal predecessors, (1845), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1867 transitions. [2022-11-23 02:42:23,756 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1867 transitions. Word has length 6 [2022-11-23 02:42:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:23,756 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 1867 transitions. [2022-11-23 02:42:23,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1867 transitions. [2022-11-23 02:42:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 02:42:23,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:23,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:23,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:23,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:23,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-11-23 02:42:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:23,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576436681] [2022-11-23 02:42:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:23,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:23,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:23,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:23,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 02:42:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:24,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 02:42:24,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:24,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:24,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576436681] [2022-11-23 02:42:24,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576436681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:24,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:24,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458044238] [2022-11-23 02:42:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:24,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:42:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:42:24,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:24,197 INFO L87 Difference]: Start difference. First operand 1577 states and 1867 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:24,251 INFO L93 Difference]: Finished difference Result 1541 states and 1830 transitions. [2022-11-23 02:42:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:42:24,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 02:42:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:24,259 INFO L225 Difference]: With dead ends: 1541 [2022-11-23 02:42:24,259 INFO L226 Difference]: Without dead ends: 1541 [2022-11-23 02:42:24,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:24,262 INFO L413 NwaCegarLoop]: 1366 mSDtfsCounter, 1336 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:24,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 1394 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:42:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2022-11-23 02:42:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1535. [2022-11-23 02:42:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 934 states have (on average 1.9293361884368307) internal successors, (1802), 1526 states have internal predecessors, (1802), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1824 transitions. [2022-11-23 02:42:24,302 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 1824 transitions. Word has length 11 [2022-11-23 02:42:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:24,303 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 1824 transitions. [2022-11-23 02:42:24,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1824 transitions. [2022-11-23 02:42:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 02:42:24,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:24,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:24,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:24,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:24,525 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:24,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-11-23 02:42:24,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:24,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196916680] [2022-11-23 02:42:24,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:24,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:24,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:24,528 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:24,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 02:42:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:24,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:42:24,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:24,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:24,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:24,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196916680] [2022-11-23 02:42:24,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196916680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:24,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:24,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880503557] [2022-11-23 02:42:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:24,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:24,767 INFO L87 Difference]: Start difference. First operand 1535 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:24,873 INFO L93 Difference]: Finished difference Result 1520 states and 1802 transitions. [2022-11-23 02:42:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:42:24,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 02:42:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:24,878 INFO L225 Difference]: With dead ends: 1520 [2022-11-23 02:42:24,879 INFO L226 Difference]: Without dead ends: 1520 [2022-11-23 02:42:24,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:24,880 INFO L413 NwaCegarLoop]: 1321 mSDtfsCounter, 1317 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:24,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 2663 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:42:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-11-23 02:42:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1513. [2022-11-23 02:42:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 926 states have (on average 1.9146868250539957) internal successors, (1773), 1504 states have internal predecessors, (1773), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1795 transitions. [2022-11-23 02:42:24,908 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1795 transitions. Word has length 13 [2022-11-23 02:42:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:24,908 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 1795 transitions. [2022-11-23 02:42:24,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1795 transitions. [2022-11-23 02:42:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 02:42:24,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:24,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:24,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:25,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:25,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-11-23 02:42:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:25,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552544644] [2022-11-23 02:42:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:25,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:25,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:25,129 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:25,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 02:42:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:25,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 02:42:25,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:25,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:42:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:25,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:25,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:25,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552544644] [2022-11-23 02:42:25,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552544644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:25,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:25,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459195551] [2022-11-23 02:42:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:25,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:25,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:25,449 INFO L87 Difference]: Start difference. First operand 1513 states and 1795 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:30,830 INFO L93 Difference]: Finished difference Result 2374 states and 2683 transitions. [2022-11-23 02:42:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:42:30,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-23 02:42:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:30,840 INFO L225 Difference]: With dead ends: 2374 [2022-11-23 02:42:30,840 INFO L226 Difference]: Without dead ends: 2374 [2022-11-23 02:42:30,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:30,841 INFO L413 NwaCegarLoop]: 675 mSDtfsCounter, 3005 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3013 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:30,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3013 Valid, 1546 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-23 02:42:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2022-11-23 02:42:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1509. [2022-11-23 02:42:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 926 states have (on average 1.9103671706263499) internal successors, (1769), 1500 states have internal predecessors, (1769), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1791 transitions. [2022-11-23 02:42:30,875 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1791 transitions. Word has length 27 [2022-11-23 02:42:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:30,876 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1791 transitions. [2022-11-23 02:42:30,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1791 transitions. [2022-11-23 02:42:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 02:42:30,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:30,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:30,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:31,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:31,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-11-23 02:42:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:31,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084336459] [2022-11-23 02:42:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:31,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:31,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:31,093 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:31,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 02:42:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:31,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:42:31,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:31,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:42:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:31,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:31,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:31,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084336459] [2022-11-23 02:42:31,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084336459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:31,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:31,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030881772] [2022-11-23 02:42:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:31,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:31,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:31,618 INFO L87 Difference]: Start difference. First operand 1509 states and 1791 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:38,026 INFO L93 Difference]: Finished difference Result 1878 states and 2059 transitions. [2022-11-23 02:42:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:42:38,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-23 02:42:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:38,034 INFO L225 Difference]: With dead ends: 1878 [2022-11-23 02:42:38,035 INFO L226 Difference]: Without dead ends: 1878 [2022-11-23 02:42:38,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:38,036 INFO L413 NwaCegarLoop]: 1060 mSDtfsCounter, 1293 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:38,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 2260 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-23 02:42:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-11-23 02:42:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1505. [2022-11-23 02:42:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 926 states have (on average 1.906047516198704) internal successors, (1765), 1496 states have internal predecessors, (1765), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1787 transitions. [2022-11-23 02:42:38,071 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1787 transitions. Word has length 27 [2022-11-23 02:42:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:38,071 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 1787 transitions. [2022-11-23 02:42:38,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1787 transitions. [2022-11-23 02:42:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-23 02:42:38,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:38,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:38,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:38,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:38,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-11-23 02:42:38,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:38,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20024663] [2022-11-23 02:42:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:38,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:38,290 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:38,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 02:42:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:38,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:42:38,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:38,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:38,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:38,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20024663] [2022-11-23 02:42:38,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20024663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:38,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:38,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:38,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466544965] [2022-11-23 02:42:38,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:38,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:38,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:38,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:38,696 INFO L87 Difference]: Start difference. First operand 1505 states and 1787 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:38,787 INFO L93 Difference]: Finished difference Result 1505 states and 1783 transitions. [2022-11-23 02:42:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:42:38,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-23 02:42:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:38,794 INFO L225 Difference]: With dead ends: 1505 [2022-11-23 02:42:38,794 INFO L226 Difference]: Without dead ends: 1505 [2022-11-23 02:42:38,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:38,798 INFO L413 NwaCegarLoop]: 1315 mSDtfsCounter, 1286 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 2641 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:38,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 2641 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:42:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2022-11-23 02:42:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1499. [2022-11-23 02:42:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 920 states have (on average 1.9076086956521738) internal successors, (1755), 1490 states have internal predecessors, (1755), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1777 transitions. [2022-11-23 02:42:38,855 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1777 transitions. Word has length 42 [2022-11-23 02:42:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:38,858 INFO L495 AbstractCegarLoop]: Abstraction has 1499 states and 1777 transitions. [2022-11-23 02:42:38,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1777 transitions. [2022-11-23 02:42:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 02:42:38,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:38,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:38,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:39,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:39,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-11-23 02:42:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:39,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527347302] [2022-11-23 02:42:39,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:39,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:39,089 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:39,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 02:42:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:39,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:42:39,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:39,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:39,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:39,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527347302] [2022-11-23 02:42:39,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527347302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:39,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:39,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:39,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776406196] [2022-11-23 02:42:39,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:39,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:42:39,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:39,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:42:39,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:39,696 INFO L87 Difference]: Start difference. First operand 1499 states and 1777 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:39,787 INFO L93 Difference]: Finished difference Result 1545 states and 1823 transitions. [2022-11-23 02:42:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:42:39,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-23 02:42:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:39,792 INFO L225 Difference]: With dead ends: 1545 [2022-11-23 02:42:39,792 INFO L226 Difference]: Without dead ends: 1545 [2022-11-23 02:42:39,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:42:39,793 INFO L413 NwaCegarLoop]: 1323 mSDtfsCounter, 67 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:39,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2551 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:42:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-11-23 02:42:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2022-11-23 02:42:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 966 states have (on average 1.8643892339544514) internal successors, (1801), 1536 states have internal predecessors, (1801), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1823 transitions. [2022-11-23 02:42:39,825 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1823 transitions. Word has length 50 [2022-11-23 02:42:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:39,825 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 1823 transitions. [2022-11-23 02:42:39,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1823 transitions. [2022-11-23 02:42:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 02:42:39,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:39,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:39,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:40,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:40,041 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-11-23 02:42:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:40,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696481709] [2022-11-23 02:42:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:40,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:40,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:40,043 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:40,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 02:42:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:40,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 02:42:40,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:40,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:42:40,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:42:40,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:42:41,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:42:41,015 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 02:42:41,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 02:42:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:41,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:41,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:41,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696481709] [2022-11-23 02:42:41,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696481709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:41,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:41,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:42:41,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981993109] [2022-11-23 02:42:41,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:41,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:41,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:41,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:41,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:41,048 INFO L87 Difference]: Start difference. First operand 1545 states and 1823 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:46,253 INFO L93 Difference]: Finished difference Result 1732 states and 1994 transitions. [2022-11-23 02:42:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:42:46,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-23 02:42:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:46,262 INFO L225 Difference]: With dead ends: 1732 [2022-11-23 02:42:46,262 INFO L226 Difference]: Without dead ends: 1732 [2022-11-23 02:42:46,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:46,263 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 1572 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:46,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 613 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-23 02:42:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-11-23 02:42:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1295. [2022-11-23 02:42:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 800 states have (on average 1.75) internal successors, (1400), 1286 states have internal predecessors, (1400), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1422 transitions. [2022-11-23 02:42:46,309 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1422 transitions. Word has length 53 [2022-11-23 02:42:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:46,310 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1422 transitions. [2022-11-23 02:42:46,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1422 transitions. [2022-11-23 02:42:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:42:46,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:46,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:46,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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)] Ended with exit code 0 [2022-11-23 02:42:46,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:46,535 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-11-23 02:42:46,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:46,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411741048] [2022-11-23 02:42:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:46,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:46,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:46,538 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:46,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-23 02:42:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:46,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 02:42:46,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:46,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:42:46,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:42:46,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 02:42:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:46,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:46,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:46,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411741048] [2022-11-23 02:42:46,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411741048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:46,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:46,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:46,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422918455] [2022-11-23 02:42:46,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:46,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:46,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:46,943 INFO L87 Difference]: Start difference. First operand 1295 states and 1422 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:51,823 INFO L93 Difference]: Finished difference Result 1294 states and 1421 transitions. [2022-11-23 02:42:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:42:51,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-23 02:42:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:51,829 INFO L225 Difference]: With dead ends: 1294 [2022-11-23 02:42:51,829 INFO L226 Difference]: Without dead ends: 1294 [2022-11-23 02:42:51,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:42:51,831 INFO L413 NwaCegarLoop]: 1235 mSDtfsCounter, 4 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:51,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3163 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-23 02:42:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-11-23 02:42:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2022-11-23 02:42:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 800 states have (on average 1.74875) internal successors, (1399), 1285 states have internal predecessors, (1399), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1421 transitions. [2022-11-23 02:42:51,860 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1421 transitions. Word has length 58 [2022-11-23 02:42:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:51,860 INFO L495 AbstractCegarLoop]: Abstraction has 1294 states and 1421 transitions. [2022-11-23 02:42:51,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1421 transitions. [2022-11-23 02:42:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 02:42:51,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:51,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:51,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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-11-23 02:42:52,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:52,080 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-11-23 02:42:52,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:52,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134053890] [2022-11-23 02:42:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:52,082 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:52,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-23 02:42:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:52,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 02:42:52,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:52,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:42:52,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:42:52,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:42:52,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-23 02:42:52,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 02:42:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:52,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:52,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134053890] [2022-11-23 02:42:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134053890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:52,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:52,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473500662] [2022-11-23 02:42:52,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:52,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:42:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:42:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:52,584 INFO L87 Difference]: Start difference. First operand 1294 states and 1421 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:58,916 INFO L93 Difference]: Finished difference Result 1293 states and 1420 transitions. [2022-11-23 02:42:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:42:58,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-23 02:42:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:58,920 INFO L225 Difference]: With dead ends: 1293 [2022-11-23 02:42:58,920 INFO L226 Difference]: Without dead ends: 1293 [2022-11-23 02:42:58,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:42:58,921 INFO L413 NwaCegarLoop]: 1235 mSDtfsCounter, 2 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:58,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3193 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-23 02:42:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-11-23 02:42:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1293. [2022-11-23 02:42:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 799 states have (on average 1.7496871088861077) internal successors, (1398), 1284 states have internal predecessors, (1398), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-23 02:42:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1420 transitions. [2022-11-23 02:42:58,960 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1420 transitions. Word has length 58 [2022-11-23 02:42:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:58,960 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1420 transitions. [2022-11-23 02:42:58,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:42:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1420 transitions. [2022-11-23 02:42:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 02:42:58,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:58,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:58,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:59,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:59,175 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:59,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1451288354, now seen corresponding path program 1 times [2022-11-23 02:42:59,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:59,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503887527] [2022-11-23 02:42:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:59,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:59,179 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:59,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-23 02:42:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:42:59,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:42:59,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:42:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:42:59,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:42:59,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:42:59,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503887527] [2022-11-23 02:42:59,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503887527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:42:59,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:42:59,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:42:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988764849] [2022-11-23 02:42:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:42:59,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:42:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:42:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:42:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:42:59,573 INFO L87 Difference]: Start difference. First operand 1293 states and 1420 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:42:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:42:59,652 INFO L93 Difference]: Finished difference Result 1296 states and 1425 transitions. [2022-11-23 02:42:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:42:59,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-11-23 02:42:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:42:59,658 INFO L225 Difference]: With dead ends: 1296 [2022-11-23 02:42:59,658 INFO L226 Difference]: Without dead ends: 1296 [2022-11-23 02:42:59,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:42:59,659 INFO L413 NwaCegarLoop]: 1234 mSDtfsCounter, 2 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:42:59,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3694 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:42:59,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2022-11-23 02:42:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2022-11-23 02:42:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 801 states have (on average 1.749063670411985) internal successors, (1401), 1287 states have internal predecessors, (1401), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:42:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1425 transitions. [2022-11-23 02:42:59,687 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1425 transitions. Word has length 66 [2022-11-23 02:42:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:42:59,687 INFO L495 AbstractCegarLoop]: Abstraction has 1296 states and 1425 transitions. [2022-11-23 02:42:59,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:42:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1425 transitions. [2022-11-23 02:42:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 02:42:59,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:42:59,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:42:59,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-23 02:42:59,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:59,906 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:42:59,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:42:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1555032163, now seen corresponding path program 1 times [2022-11-23 02:42:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:42:59,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284307755] [2022-11-23 02:42:59,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:42:59,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:42:59,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:42:59,909 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:42:59,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-23 02:43:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:43:00,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 02:43:00,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:43:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:43:00,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:43:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:43:00,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:43:00,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284307755] [2022-11-23 02:43:00,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284307755] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:43:00,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:43:00,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-23 02:43:00,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013978345] [2022-11-23 02:43:00,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:43:00,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:43:00,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:43:00,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:43:00,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:43:00,392 INFO L87 Difference]: Start difference. First operand 1296 states and 1425 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:43:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:43:00,686 INFO L93 Difference]: Finished difference Result 1308 states and 1443 transitions. [2022-11-23 02:43:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:43:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-23 02:43:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:43:00,691 INFO L225 Difference]: With dead ends: 1308 [2022-11-23 02:43:00,691 INFO L226 Difference]: Without dead ends: 1308 [2022-11-23 02:43:00,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-23 02:43:00,696 INFO L413 NwaCegarLoop]: 1234 mSDtfsCounter, 14 mSDsluCounter, 7361 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8595 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:43:00,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8595 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:43:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2022-11-23 02:43:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1306. [2022-11-23 02:43:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 810 states have (on average 1.7481481481481482) internal successors, (1416), 1296 states have internal predecessors, (1416), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:43:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1440 transitions. [2022-11-23 02:43:00,720 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1440 transitions. Word has length 67 [2022-11-23 02:43:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:43:00,721 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1440 transitions. [2022-11-23 02:43:00,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:43:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1440 transitions. [2022-11-23 02:43:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-23 02:43:00,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:43:00,722 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:43:00,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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-11-23 02:43:00,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:43:00,936 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:43:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:43:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 354963614, now seen corresponding path program 2 times [2022-11-23 02:43:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:43:00,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234393239] [2022-11-23 02:43:00,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:43:00,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:43:00,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:43:00,938 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:43:00,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-23 02:43:01,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:43:01,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:43:01,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 02:43:01,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:43:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:43:01,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:43:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:43:01,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:43:01,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234393239] [2022-11-23 02:43:01,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234393239] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:43:01,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:43:01,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-23 02:43:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029411081] [2022-11-23 02:43:01,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:43:01,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 02:43:01,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:43:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 02:43:01,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-23 02:43:01,803 INFO L87 Difference]: Start difference. First operand 1306 states and 1440 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:43:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:43:02,942 INFO L93 Difference]: Finished difference Result 1327 states and 1472 transitions. [2022-11-23 02:43:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 02:43:02,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-11-23 02:43:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:43:02,949 INFO L225 Difference]: With dead ends: 1327 [2022-11-23 02:43:02,949 INFO L226 Difference]: Without dead ends: 1323 [2022-11-23 02:43:02,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-23 02:43:02,951 INFO L413 NwaCegarLoop]: 1237 mSDtfsCounter, 66 mSDsluCounter, 6163 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 7400 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:43:02,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 7400 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 02:43:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-11-23 02:43:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1315. [2022-11-23 02:43:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 819 states have (on average 1.7435897435897436) internal successors, (1428), 1305 states have internal predecessors, (1428), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:43:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1452 transitions. [2022-11-23 02:43:02,983 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1452 transitions. Word has length 70 [2022-11-23 02:43:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:43:02,984 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 1452 transitions. [2022-11-23 02:43:02,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:43:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1452 transitions. [2022-11-23 02:43:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-23 02:43:02,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:43:02,986 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:43:03,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-23 02:43:03,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:43:03,201 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:43:03,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:43:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1982439486, now seen corresponding path program 3 times [2022-11-23 02:43:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:43:03,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313767030] [2022-11-23 02:43:03,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:43:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:43:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:43:03,205 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:43:03,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-23 02:43:04,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-23 02:43:04,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:43:04,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 02:43:04,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:43:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:43:04,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:43:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:43:05,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:43:05,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313767030] [2022-11-23 02:43:05,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313767030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:43:05,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:43:05,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-23 02:43:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640770276] [2022-11-23 02:43:05,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:43:05,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 02:43:05,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:43:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 02:43:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-23 02:43:05,775 INFO L87 Difference]: Start difference. First operand 1315 states and 1452 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:43:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:43:10,784 INFO L93 Difference]: Finished difference Result 1357 states and 1528 transitions. [2022-11-23 02:43:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 02:43:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-11-23 02:43:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:43:10,794 INFO L225 Difference]: With dead ends: 1357 [2022-11-23 02:43:10,795 INFO L226 Difference]: Without dead ends: 1351 [2022-11-23 02:43:10,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 02:43:10,796 INFO L413 NwaCegarLoop]: 1241 mSDtfsCounter, 166 mSDsluCounter, 14819 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 16060 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:43:10,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 16060 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 02:43:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-11-23 02:43:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1333. [2022-11-23 02:43:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 837 states have (on average 1.7335722819593786) internal successors, (1451), 1323 states have internal predecessors, (1451), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:43:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1475 transitions. [2022-11-23 02:43:10,832 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1475 transitions. Word has length 76 [2022-11-23 02:43:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:43:10,832 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1475 transitions. [2022-11-23 02:43:10,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:43:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1475 transitions. [2022-11-23 02:43:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-23 02:43:10,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:43:10,834 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:43:10,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-23 02:43:11,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:43:11,051 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:43:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:43:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash -687892610, now seen corresponding path program 4 times [2022-11-23 02:43:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:43:11,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807746570] [2022-11-23 02:43:11,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 02:43:11,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:43:11,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:43:11,054 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:43:11,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-23 02:43:11,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 02:43:11,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:43:11,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 02:43:11,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:43:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:43:12,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:43:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:43:14,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:43:14,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807746570] [2022-11-23 02:43:14,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807746570] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:43:14,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:43:14,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-23 02:43:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182887545] [2022-11-23 02:43:14,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:43:14,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-23 02:43:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:43:14,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-23 02:43:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-23 02:43:14,896 INFO L87 Difference]: Start difference. First operand 1333 states and 1475 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:43:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:43:31,818 INFO L93 Difference]: Finished difference Result 1413 states and 1608 transitions. [2022-11-23 02:43:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-23 02:43:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-11-23 02:43:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:43:31,823 INFO L225 Difference]: With dead ends: 1413 [2022-11-23 02:43:31,823 INFO L226 Difference]: Without dead ends: 1409 [2022-11-23 02:43:31,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-23 02:43:31,827 INFO L413 NwaCegarLoop]: 1254 mSDtfsCounter, 448 mSDsluCounter, 31184 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 32438 SdHoareTripleChecker+Invalid, 3562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 3115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:43:31,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 32438 Invalid, 3562 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [447 Valid, 3115 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-23 02:43:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-11-23 02:43:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1367. [2022-11-23 02:43:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 871 states have (on average 1.7187141216991964) internal successors, (1497), 1357 states have internal predecessors, (1497), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:43:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1521 transitions. [2022-11-23 02:43:31,854 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1521 transitions. Word has length 88 [2022-11-23 02:43:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:43:31,855 INFO L495 AbstractCegarLoop]: Abstraction has 1367 states and 1521 transitions. [2022-11-23 02:43:31,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:43:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1521 transitions. [2022-11-23 02:43:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-23 02:43:31,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:43:31,856 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:43:31,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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-11-23 02:43:32,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:43:32,071 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:43:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:43:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1393730018, now seen corresponding path program 5 times [2022-11-23 02:43:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:43:32,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761251022] [2022-11-23 02:43:32,072 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 02:43:32,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:43:32,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:43:32,074 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:43:32,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-23 02:43:33,827 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-23 02:43:33,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:43:33,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-23 02:43:33,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:43:33,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:43:34,095 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 02:43:34,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 02:43:34,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:43:34,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 02:43:36,029 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1631)))) is different from true [2022-11-23 02:43:36,724 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:43:36,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:43:36,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 02:43:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 02:43:36,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:43:37,337 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:43:37,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:43:37,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761251022] [2022-11-23 02:43:37,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761251022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:43:37,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1512105821] [2022-11-23 02:43:37,340 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 02:43:37,341 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 02:43:37,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 02:43:37,342 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 02:43:37,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-23 02:45:00,470 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-23 02:45:00,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:45:00,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 02:45:00,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:45:00,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:45:00,942 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 02:45:00,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 02:45:00,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:45:01,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 02:45:03,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:45:03,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:45:03,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 02:45:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-23 02:45:03,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:45:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1512105821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:45:05,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:45:05,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2022-11-23 02:45:05,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050606159] [2022-11-23 02:45:05,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:45:05,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:45:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:45:05,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:45:05,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=95, Unknown=12, NotChecked=42, Total=182 [2022-11-23 02:45:05,895 INFO L87 Difference]: Start difference. First operand 1367 states and 1521 transitions. Second operand has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:45:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:45:25,237 INFO L93 Difference]: Finished difference Result 1690 states and 1831 transitions. [2022-11-23 02:45:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:45:25,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-11-23 02:45:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:45:25,244 INFO L225 Difference]: With dead ends: 1690 [2022-11-23 02:45:25,244 INFO L226 Difference]: Without dead ends: 1686 [2022-11-23 02:45:25,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 125 SyntacticMatches, 90 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=52, Invalid=151, Unknown=15, NotChecked=54, Total=272 [2022-11-23 02:45:25,245 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 1138 mSDsluCounter, 2741 mSDsCounter, 0 mSdLazyCounter, 3343 mSolverCounterSat, 12 mSolverCounterUnsat, 1102 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 3396 SdHoareTripleChecker+Invalid, 5703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3343 IncrementalHoareTripleChecker+Invalid, 1102 IncrementalHoareTripleChecker+Unknown, 1246 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:45:25,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 3396 Invalid, 5703 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 3343 Invalid, 1102 Unknown, 1246 Unchecked, 19.0s Time] [2022-11-23 02:45:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2022-11-23 02:45:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1415. [2022-11-23 02:45:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 919 states have (on average 1.6811751904243744) internal successors, (1545), 1404 states have internal predecessors, (1545), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:45:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1569 transitions. [2022-11-23 02:45:25,279 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1569 transitions. Word has length 110 [2022-11-23 02:45:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:45:25,279 INFO L495 AbstractCegarLoop]: Abstraction has 1415 states and 1569 transitions. [2022-11-23 02:45:25,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.5) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:45:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1569 transitions. [2022-11-23 02:45:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-23 02:45:25,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:45:25,282 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:45:25,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-11-23 02:45:25,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-23 02:45:25,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:45:25,697 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:45:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:45:25,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1393730017, now seen corresponding path program 1 times [2022-11-23 02:45:25,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:45:25,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756841763] [2022-11-23 02:45:25,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:45:25,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:45:25,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:45:25,700 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:45:25,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-23 02:45:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:45:26,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-23 02:45:26,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:45:26,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:45:27,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:45:27,056 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 02:45:27,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 02:45:27,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:45:27,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:45:27,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 02:45:27,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 02:45:27,401 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:27,484 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-11-23 02:45:27,504 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:45:27,524 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:45:27,598 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-11-23 02:45:27,619 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512)))) is different from true [2022-11-23 02:45:27,684 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:27,704 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-11-23 02:45:27,724 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-11-23 02:45:27,745 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:27,765 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:27,782 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:45:27,807 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:45:27,826 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531)))) is different from true [2022-11-23 02:45:27,843 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:27,863 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-11-23 02:45:27,883 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-11-23 02:45:27,902 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:45:27,924 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:45:27,944 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:27,963 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:45:27,982 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:28,000 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:45:28,016 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:45:28,041 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552)))) is different from true [2022-11-23 02:45:28,059 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:28,075 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:45:28,091 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558)))) is different from true [2022-11-23 02:45:28,110 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:28,130 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563)))) is different from true [2022-11-23 02:45:28,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2564)))) is different from true [2022-11-23 02:45:28,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567)))) is different from true [2022-11-23 02:45:28,190 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568)))) is different from true [2022-11-23 02:45:28,247 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:28,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573)))) is different from true [2022-11-23 02:45:28,286 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2575)))) is different from true [2022-11-23 02:45:28,305 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2576))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:28,329 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:28,348 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2581))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580)))) is different from true [2022-11-23 02:45:28,367 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:28,387 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:45:28,456 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:45:28,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:45:28,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:45:28,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 02:45:28,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 02:45:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-11-23 02:45:28,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:45:30,104 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |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_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 02:45:30,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:45:30,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756841763] [2022-11-23 02:45:30,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756841763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:45:30,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [216303912] [2022-11-23 02:45:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:45:30,112 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 02:45:30,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 02:45:30,113 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 02:45:30,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-23 02:47:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:47:26,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-23 02:47:26,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:47:26,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:47:26,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:47:26,801 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 02:47:26,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 02:47:26,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:47:26,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:47:26,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 02:47:26,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 02:47:27,029 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,044 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3040 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3040))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3041) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:47:27,061 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,119 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047)))) is different from true [2022-11-23 02:47:27,135 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,153 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,169 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,186 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055)))) is different from true [2022-11-23 02:47:27,203 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:47:27,224 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3059))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058)))) is different from true [2022-11-23 02:47:27,240 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,256 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3062))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063)))) is different from true [2022-11-23 02:47:27,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064)))) is different from true [2022-11-23 02:47:27,286 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3066))) (exists ((v_ArrVal_3067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3067) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,306 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,320 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071)))) is different from true [2022-11-23 02:47:27,334 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:47:27,351 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,365 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3076 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3076))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3077 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3077) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:47:27,379 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,393 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081)))) is different from true [2022-11-23 02:47:27,406 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,434 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085)))) is different from true [2022-11-23 02:47:27,450 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087))) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,466 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3088 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3088) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089)))) is different from true [2022-11-23 02:47:27,483 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,499 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092))) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,514 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3094))) (exists ((v_ArrVal_3095 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3095))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3097) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3096 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3096))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,547 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099))) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,563 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3100) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3101 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3101) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:47:27,578 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103)))) is different from true [2022-11-23 02:47:27,594 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104))) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,610 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3107 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3107))) (exists ((v_ArrVal_3106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3106))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,628 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108)))) is different from true [2022-11-23 02:47:27,644 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,661 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113)))) is different from true [2022-11-23 02:47:27,676 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115))) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,692 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116))) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,709 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3119) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3118) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:47:27,725 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:47:27,741 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3122))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,773 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3124) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3125) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-11-23 02:47:27,828 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:47:27,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:47:27,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:47:27,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 02:47:27,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 02:47:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-11-23 02:47:27,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:47:28,870 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-23 02:47:28,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [216303912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:47:28,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:47:28,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 51] total 92 [2022-11-23 02:47:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041501777] [2022-11-23 02:47:28,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:47:28,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-11-23 02:47:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:47:28,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-11-23 02:47:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=168, Unknown=91, NotChecked=8858, Total=9312 [2022-11-23 02:47:28,883 INFO L87 Difference]: Start difference. First operand 1415 states and 1569 transitions. Second operand has 93 states, 91 states have (on average 1.6923076923076923) internal successors, (154), 93 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:47:29,653 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-11-23 02:47:29,754 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:47:29,761 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:47:29,768 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:47:29,777 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:47:29,787 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:47:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:47:43,688 INFO L93 Difference]: Finished difference Result 1697 states and 1841 transitions. [2022-11-23 02:47:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 02:47:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 91 states have (on average 1.6923076923076923) internal successors, (154), 93 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 110 [2022-11-23 02:47:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:47:43,693 INFO L225 Difference]: With dead ends: 1697 [2022-11-23 02:47:43,693 INFO L226 Difference]: Without dead ends: 1697 [2022-11-23 02:47:43,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 107 ConstructedPredicates, 92 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=292, Unknown=103, NotChecked=11132, Total=11772 [2022-11-23 02:47:43,701 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 1143 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 4417 mSolverCounterSat, 16 mSolverCounterUnsat, 561 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 110456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4417 IncrementalHoareTripleChecker+Invalid, 561 IncrementalHoareTripleChecker+Unknown, 105462 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:47:43,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 2909 Invalid, 110456 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 4417 Invalid, 561 Unknown, 105462 Unchecked, 14.1s Time] [2022-11-23 02:47:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2022-11-23 02:47:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1425. [2022-11-23 02:47:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 928 states have (on average 1.6799568965517242) internal successors, (1559), 1413 states have internal predecessors, (1559), 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-11-23 02:47:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1584 transitions. [2022-11-23 02:47:43,744 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1584 transitions. Word has length 110 [2022-11-23 02:47:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:47:43,745 INFO L495 AbstractCegarLoop]: Abstraction has 1425 states and 1584 transitions. [2022-11-23 02:47:43,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 91 states have (on average 1.6923076923076923) internal successors, (154), 93 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:47:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1584 transitions. [2022-11-23 02:47:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-23 02:47:43,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:47:43,747 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:47:43,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-23 02:47:43,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-23 02:47:44,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:47:44,167 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:47:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:47:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash 229276254, now seen corresponding path program 2 times [2022-11-23 02:47:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:47:44,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130895728] [2022-11-23 02:47:44,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:47:44,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:47:44,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:47:44,171 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:47:44,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-23 02:47:45,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:47:45,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:47:45,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-23 02:47:45,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:47:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:47:48,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:48:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 1 proven. 1034 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:48:02,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:48:02,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130895728] [2022-11-23 02:48:02,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130895728] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:48:02,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:48:02,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2022-11-23 02:48:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919296772] [2022-11-23 02:48:02,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:48:02,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-11-23 02:48:02,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:48:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-11-23 02:48:02,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2355, Invalid=6765, Unknown=0, NotChecked=0, Total=9120 [2022-11-23 02:48:02,366 INFO L87 Difference]: Start difference. First operand 1425 states and 1584 transitions. Second operand has 96 states, 96 states have (on average 1.6354166666666667) internal successors, (157), 96 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:48:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:48:34,838 INFO L93 Difference]: Finished difference Result 1542 states and 1805 transitions. [2022-11-23 02:48:34,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-23 02:48:34,839 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.6354166666666667) internal successors, (157), 96 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-11-23 02:48:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:48:34,842 INFO L225 Difference]: With dead ends: 1542 [2022-11-23 02:48:34,843 INFO L226 Difference]: Without dead ends: 1521 [2022-11-23 02:48:34,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=4656, Invalid=15366, Unknown=0, NotChecked=0, Total=20022 [2022-11-23 02:48:34,848 INFO L413 NwaCegarLoop]: 1273 mSDtfsCounter, 442 mSDsluCounter, 58128 mSDsCounter, 0 mSdLazyCounter, 12023 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 59401 SdHoareTripleChecker+Invalid, 12171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 12023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:48:34,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 59401 Invalid, 12171 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [148 Valid, 12023 Invalid, 0 Unknown, 0 Unchecked, 28.6s Time] [2022-11-23 02:48:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2022-11-23 02:48:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1437. [2022-11-23 02:48:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 942 states have (on average 1.683651804670913) internal successors, (1586), 1426 states have internal predecessors, (1586), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:48:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1610 transitions. [2022-11-23 02:48:34,882 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1610 transitions. Word has length 111 [2022-11-23 02:48:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:48:34,882 INFO L495 AbstractCegarLoop]: Abstraction has 1437 states and 1610 transitions. [2022-11-23 02:48:34,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.6354166666666667) internal successors, (157), 96 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:48:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1610 transitions. [2022-11-23 02:48:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-23 02:48:34,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:48:34,884 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:48:34,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-11-23 02:48:35,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:48:35,099 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:48:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:48:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1161843689, now seen corresponding path program 1 times [2022-11-23 02:48:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:48:35,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769451595] [2022-11-23 02:48:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:35,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:48:35,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:48:35,102 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:48:35,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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-11-23 02:48:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:36,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-23 02:48:36,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:48:36,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:48:36,461 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 02:48:36,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 02:48:36,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:48:36,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 02:48:37,636 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_3963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3963) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:48:38,515 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:48:38,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:48:38,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:48:38,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:48:38,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 02:48:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 02:48:38,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:48:40,869 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3986 (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_3986) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:48:41,216 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4032 (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_4032))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3986)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:48:41,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:48:41,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769451595] [2022-11-23 02:48:41,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769451595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:48:41,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [193618607] [2022-11-23 02:48:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:48:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 02:48:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 02:48:41,223 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 02:48:41,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-23 02:48:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:48:45,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 02:48:45,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:48:45,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:48:45,614 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 02:48:45,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 02:48:45,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:48:45,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 02:48:46,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4402 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4402) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:48:46,277 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4410 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4410) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:48:46,344 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4412) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:48:46,408 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4414)))) is different from true [2022-11-23 02:48:47,091 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4432)))) is different from true [2022-11-23 02:48:47,259 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_35 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_35) (_ bv1 1))) (not (= v_arrayElimCell_35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4437)))) is different from true [2022-11-23 02:48:47,432 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:48:47,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:48:47,525 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:48:47,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:48:47,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 02:48:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-23 02:48:47,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:48:47,598 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4441 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4441) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 02:48:47,613 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4441 (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_4441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 02:48:47,938 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4487 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4441 (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_4487))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4441)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:48:47,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [193618607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:48:47,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:48:47,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 16 [2022-11-23 02:48:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608133607] [2022-11-23 02:48:47,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:48:47,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 02:48:47,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:48:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 02:48:47,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=123, Unknown=23, NotChecked=396, Total=600 [2022-11-23 02:48:47,943 INFO L87 Difference]: Start difference. First operand 1437 states and 1610 transitions. Second operand has 17 states, 15 states have (on average 5.533333333333333) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:49:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:49:03,701 INFO L93 Difference]: Finished difference Result 1707 states and 1865 transitions. [2022-11-23 02:49:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:49:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.533333333333333) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-11-23 02:49:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:49:03,707 INFO L225 Difference]: With dead ends: 1707 [2022-11-23 02:49:03,707 INFO L226 Difference]: Without dead ends: 1707 [2022-11-23 02:49:03,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 132 SyntacticMatches, 84 SemanticMatches, 26 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=77, Invalid=185, Unknown=26, NotChecked=468, Total=756 [2022-11-23 02:49:03,708 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 1132 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 3398 mSolverCounterSat, 13 mSolverCounterUnsat, 1071 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 13169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3398 IncrementalHoareTripleChecker+Invalid, 1071 IncrementalHoareTripleChecker+Unknown, 8687 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:49:03,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 3400 Invalid, 13169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3398 Invalid, 1071 Unknown, 8687 Unchecked, 15.5s Time] [2022-11-23 02:49:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-11-23 02:49:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1436. [2022-11-23 02:49:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 942 states have (on average 1.6825902335456475) internal successors, (1585), 1425 states have internal predecessors, (1585), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:49:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1609 transitions. [2022-11-23 02:49:03,733 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1609 transitions. Word has length 113 [2022-11-23 02:49:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:49:03,733 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 1609 transitions. [2022-11-23 02:49:03,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.533333333333333) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:49:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1609 transitions. [2022-11-23 02:49:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-23 02:49:03,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:49:03,735 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:49:03,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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)] Forceful destruction successful, exit code 0 [2022-11-23 02:49:03,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-23 02:49:04,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt [2022-11-23 02:49:04,158 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:49:04,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:49:04,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1161843688, now seen corresponding path program 1 times [2022-11-23 02:49:04,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:49:04,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969910241] [2022-11-23 02:49:04,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:49:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:49:04,160 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:49:04,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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)] Waiting until timeout for monitored process [2022-11-23 02:49:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:49:05,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-23 02:49:05,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:49:05,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:49:05,403 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 02:49:05,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 02:49:05,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:49:05,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:49:05,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:49:05,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 02:49:05,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 02:49:05,759 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4857)))) is different from true [2022-11-23 02:49:05,772 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4858) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4859) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:05,787 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4860))) (exists ((v_ArrVal_4861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4861) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:49:05,800 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4862) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4863) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:49:05,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4864))) (exists ((v_ArrVal_4865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4865) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:49:05,828 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4867) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4866)))) is different from true [2022-11-23 02:49:05,878 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4870))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:05,891 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4873) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4872) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:05,905 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4874) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4875)))) is different from true [2022-11-23 02:49:05,924 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4877))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4876)))) is different from true [2022-11-23 02:49:05,940 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4879))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:05,955 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4881 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4881) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4880)))) is different from true [2022-11-23 02:49:05,971 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4883))) (exists ((v_ArrVal_4882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4882)))) is different from true [2022-11-23 02:49:05,987 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4884))) (exists ((v_ArrVal_4885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4885)))) is different from true [2022-11-23 02:49:06,003 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4887 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4887) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4886)))) is different from true [2022-11-23 02:49:06,108 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4892) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4893) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:49:06,125 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4895) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:06,142 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4896))) (exists ((v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4897))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-23 02:49:06,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902)))) is different from true [2022-11-23 02:49:06,260 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-23 02:49:06,276 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-23 02:49:06,291 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908)))) is different from true [2022-11-23 02:49:06,307 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4911))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:49:06,324 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4913))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4912)))) is different from true [2022-11-23 02:49:06,378 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:49:06,391 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:06,405 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921))) (exists ((v_ArrVal_4920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4920)))) is different from true [2022-11-23 02:49:06,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4923) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4922)))) is different from true [2022-11-23 02:49:06,454 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-23 02:49:06,469 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927)))) is different from true [2022-11-23 02:49:06,484 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929)))) is different from true [2022-11-23 02:49:06,499 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931)))) is different from true [2022-11-23 02:49:06,514 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4933))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4932)))) is different from true [2022-11-23 02:49:06,528 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:06,551 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4937) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:06,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4939 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4939) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4938) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:49:06,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941))) (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:49:06,646 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:49:06,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:49:06,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:49:06,811 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:49:06,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:49:06,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:49:06,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 02:49:06,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 02:49:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 962 not checked. [2022-11-23 02:49:06,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:49:07,159 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4943 (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_4943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4942) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 02:49:07,202 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_4942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4942) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4943) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-23 02:49:09,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:49:09,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969910241] [2022-11-23 02:49:09,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969910241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:49:09,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1620687089] [2022-11-23 02:49:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:49:09,006 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 02:49:09,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 02:49:09,007 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 02:49:09,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-23 02:51:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:51:12,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-23 02:51:12,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:51:12,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:51:12,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:51:12,247 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 02:51:12,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 02:51:12,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:51:12,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:51:12,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 02:51:12,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 02:51:12,563 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5412))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5411)))) is different from true [2022-11-23 02:51:12,576 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5413))) (exists ((v_ArrVal_5414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5414))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-23 02:51:12,588 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5416) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5415)))) is different from true [2022-11-23 02:51:12,600 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5418))) (exists ((v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5417)))) is different from true [2022-11-23 02:51:12,615 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5419))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5420) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:12,628 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5421))) (exists ((v_ArrVal_5422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5422) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:12,641 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5423 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5423) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5424) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:12,653 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5425))) (exists ((v_ArrVal_5426 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5426))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-23 02:51:12,667 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5428) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5427) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:51:12,682 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5429 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5429))) (exists ((v_ArrVal_5430 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5430) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:12,696 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5432))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5431) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:51:12,711 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5433 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5433))) (exists ((v_ArrVal_5434 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5434) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:51:12,725 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5436) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5435)))) is different from true [2022-11-23 02:51:12,739 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5437))) (exists ((v_ArrVal_5438 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5438)))) is different from true [2022-11-23 02:51:12,822 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5444))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5443) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:51:12,835 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5445))) (exists ((v_ArrVal_5446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5446) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:12,848 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5448) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5447)))) is different from true [2022-11-23 02:51:12,860 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5450))) (exists ((v_ArrVal_5449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5449))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-23 02:51:12,873 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5452)))) is different from true [2022-11-23 02:51:12,886 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5453))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5454)))) is different from true [2022-11-23 02:51:12,898 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5455))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5456 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5456) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:51:12,910 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5458 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5458) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5457)))) is different from true [2022-11-23 02:51:12,923 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5460))) (exists ((v_ArrVal_5459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5459)))) is different from true [2022-11-23 02:51:12,936 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5462))) (exists ((v_ArrVal_5461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5461)))) is different from true [2022-11-23 02:51:12,949 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5463))) (exists ((v_ArrVal_5464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5464) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:51:12,963 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5465))) (exists ((v_ArrVal_5466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5466)))) is different from true [2022-11-23 02:51:12,977 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5468))) (exists ((v_ArrVal_5467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5467) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:12,991 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5469 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5469) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5470) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:13,004 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5471))) (exists ((v_ArrVal_5472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5472) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:13,017 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5473))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5474 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5474)))) is different from true [2022-11-23 02:51:13,030 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5475))) (exists ((v_ArrVal_5476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5476))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47)))) is different from true [2022-11-23 02:51:13,042 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5478 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5478))) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5477 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5477) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:13,055 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5479))) (exists ((v_ArrVal_5480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5480)))) is different from true [2022-11-23 02:51:13,067 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5482 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5482))) (exists ((v_ArrVal_5481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5481)))) is different from true [2022-11-23 02:51:13,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5483))) (exists ((v_ArrVal_5484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5484)))) is different from true [2022-11-23 02:51:13,093 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_5486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5486) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5485)))) is different from true [2022-11-23 02:51:13,234 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:51:13,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:51:13,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:51:13,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:51:13,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:51:13,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:51:13,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 02:51:13,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 02:51:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2022-11-23 02:51:13,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:51:13,454 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5492 (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_5491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 02:51:13,495 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_5491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-23 02:51:14,516 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5584 (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_5584) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5584 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5583))) (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_5584) .cse2 v_ArrVal_5491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-23 02:51:14,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1620687089] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:51:14,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:51:14,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 82 [2022-11-23 02:51:14,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445422734] [2022-11-23 02:51:14,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:51:14,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-23 02:51:14,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:51:14,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-23 02:51:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=190, Unknown=92, NotChecked=7722, Total=8190 [2022-11-23 02:51:14,531 INFO L87 Difference]: Start difference. First operand 1436 states and 1609 transitions. Second operand has 83 states, 81 states have (on average 1.8518518518518519) internal successors, (150), 83 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:51:15,972 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4870))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_ArrVal_5444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5444))) (exists ((v_ArrVal_5412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5412))) (exists ((v_ArrVal_4856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5411))) (exists ((v_ArrVal_4854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4892) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902))) (exists ((v_ArrVal_4893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4893) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4855))) (exists ((v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4857)))) is different from true [2022-11-23 02:51:15,979 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4870))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_ArrVal_5444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5444))) (exists ((v_ArrVal_5413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5413))) (exists ((v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5412))) (exists ((v_ArrVal_5414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5414))) (exists ((v_ArrVal_4856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4895) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5411))) (exists ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4872) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5445))) (exists ((v_ArrVal_4858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4858) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4859) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4892) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5446) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902))) (exists ((v_ArrVal_4893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4893) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4855))) (exists ((v_ArrVal_4919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4857))) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-23 02:51:15,989 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4870))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4896))) (exists ((v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4897))) (exists ((v_ArrVal_5444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5444))) (exists ((v_ArrVal_5413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5413))) (exists ((v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5448) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_5412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5412))) (exists ((v_ArrVal_5414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5414))) (exists ((v_ArrVal_4856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4895) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5411))) (exists ((v_ArrVal_4920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4920))) (exists ((v_ArrVal_4860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4860))) (exists ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4872) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4874) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4875))) (exists ((v_ArrVal_5445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5445))) (exists ((v_ArrVal_4858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4858) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5416) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5415))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4859) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4892) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5446) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902))) (exists ((v_ArrVal_4893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4893) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4855))) (exists ((v_ArrVal_5447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5447))) (exists ((v_ArrVal_4919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4857))) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-23 02:51:16,002 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4870))) (exists ((v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5450))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_5449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5449))) (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4896))) (exists ((v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4897))) (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5444))) (exists ((v_ArrVal_4862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5413))) (exists ((v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5448) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4877))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_5412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5412))) (exists ((v_ArrVal_5414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5414))) (exists ((v_ArrVal_4856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4863) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4895) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5411))) (exists ((v_ArrVal_4920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4920))) (exists ((v_ArrVal_4860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4860))) (exists ((v_ArrVal_4876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4876))) (exists ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4872) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4874) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4875))) (exists ((v_ArrVal_5445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5445))) (exists ((v_ArrVal_4858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4858) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5416) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5415))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4923) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4859) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4892) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5446) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902))) (exists ((v_ArrVal_4893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4893) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4855))) (exists ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5418))) (exists ((v_ArrVal_5447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5447))) (exists ((v_ArrVal_4922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4922))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (exists ((v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5417))) (exists ((v_ArrVal_4919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4857))) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-23 02:51:16,015 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4870))) (exists ((v_ArrVal_5419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5419))) (exists ((v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5450))) (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_5449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5449))) (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4896))) (exists ((v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4897))) (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5444))) (exists ((v_ArrVal_4862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5413))) (exists ((v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5448) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4877))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_5412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5412))) (exists ((v_ArrVal_4879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4879))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5414))) (exists ((v_ArrVal_4856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4863) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4895) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4864))) (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5411))) (exists ((v_ArrVal_4920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4920))) (exists ((v_ArrVal_4860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4860))) (exists ((v_ArrVal_4876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4876))) (exists ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4872) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4874) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4875))) (exists ((v_ArrVal_5445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5445))) (exists ((v_ArrVal_4858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4858) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5416) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5415))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4923) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4865) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4859) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5420) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4892) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5446) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902))) (exists ((v_ArrVal_4893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4893) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4911))) (exists ((v_ArrVal_4855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4855))) (exists ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5418))) (exists ((v_ArrVal_5447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5447))) (exists ((v_ArrVal_4922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4922))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (exists ((v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5452))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5417))) (exists ((v_ArrVal_4919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4857))) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-23 02:51:16,028 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4867) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4870 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4870))) (exists ((v_ArrVal_5419 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5419))) (exists ((v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5450))) (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_ArrVal_4903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4903))) (exists ((v_ArrVal_5449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5449))) (exists ((v_ArrVal_4916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4916))) (exists ((v_ArrVal_4907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4907) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4896))) (exists ((v_ArrVal_5453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5453))) (exists ((v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4897))) (exists ((v_ArrVal_4909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4909) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5444))) (exists ((v_ArrVal_4913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4913))) (exists ((v_ArrVal_4862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4862) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5413))) (exists ((v_ArrVal_4873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4873) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5448 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5448) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4877))) (exists ((v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4904) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4906))) (exists ((v_ArrVal_5412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5412))) (exists ((v_ArrVal_4879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4879))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5414))) (exists ((v_ArrVal_4856 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4856) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_47))) (exists ((v_ArrVal_4863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4863) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4895) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4864 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4864))) (exists ((v_ArrVal_4921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4921))) (exists ((v_ArrVal_4871 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4871) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5411 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5411))) (exists ((v_ArrVal_5421 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5421))) (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926))) (exists ((v_ArrVal_4920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4920))) (exists ((v_ArrVal_4860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4860))) (exists ((v_ArrVal_4876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4876))) (exists ((v_ArrVal_4872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4872) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4874) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4881 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4881) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4875))) (exists ((v_ArrVal_4880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4880))) (exists ((v_ArrVal_5445 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5445))) (exists ((v_ArrVal_4858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4858) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5422) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5416 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5416) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4854) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5415))) (exists ((v_ArrVal_4917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4923) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4865) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4866))) (exists ((v_ArrVal_4859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4859) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5420) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5443 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5443) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4892) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5451 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5451) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4878) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5446) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927))) (exists ((v_ArrVal_4894 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4894) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5454))) (exists ((v_ArrVal_4902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4902))) (exists ((v_ArrVal_4893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4893) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4911))) (exists ((v_ArrVal_4855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4855))) (exists ((v_ArrVal_5418 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5418))) (exists ((v_ArrVal_5447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5447))) (exists ((v_ArrVal_4922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4922))) (exists ((v_ArrVal_4912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4912))) (exists ((v_ArrVal_4908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4908))) (exists ((v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5452))) (exists ((v_ArrVal_4910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5417 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5417))) (exists ((v_ArrVal_4919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4919) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4857 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4857))) (exists ((v_ArrVal_4918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4861) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4905)))) is different from true [2022-11-23 02:51:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:51:33,973 INFO L93 Difference]: Finished difference Result 1706 states and 1864 transitions. [2022-11-23 02:51:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 02:51:33,974 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 81 states have (on average 1.8518518518518519) internal successors, (150), 83 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 113 [2022-11-23 02:51:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:51:33,977 INFO L225 Difference]: With dead ends: 1706 [2022-11-23 02:51:33,977 INFO L226 Difference]: Without dead ends: 1706 [2022-11-23 02:51:33,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 132 SyntacticMatches, 18 SemanticMatches, 102 ConstructedPredicates, 84 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=244, Invalid=365, Unknown=107, NotChecked=9996, Total=10712 [2022-11-23 02:51:33,978 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 1135 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 5510 mSolverCounterSat, 14 mSolverCounterUnsat, 655 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 96882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5510 IncrementalHoareTripleChecker+Invalid, 655 IncrementalHoareTripleChecker+Unknown, 90703 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:51:33,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2928 Invalid, 96882 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 5510 Invalid, 655 Unknown, 90703 Unchecked, 18.3s Time] [2022-11-23 02:51:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2022-11-23 02:51:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1435. [2022-11-23 02:51:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 942 states have (on average 1.6815286624203822) internal successors, (1584), 1424 states have internal predecessors, (1584), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:51:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1608 transitions. [2022-11-23 02:51:34,000 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1608 transitions. Word has length 113 [2022-11-23 02:51:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:51:34,000 INFO L495 AbstractCegarLoop]: Abstraction has 1435 states and 1608 transitions. [2022-11-23 02:51:34,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 81 states have (on average 1.8518518518518519) internal successors, (150), 83 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 02:51:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1608 transitions. [2022-11-23 02:51:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-23 02:51:34,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:51:34,002 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:51:34,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-23 02:51:34,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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)] Forceful destruction successful, exit code 0 [2022-11-23 02:51:34,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:51:34,416 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:51:34,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:51:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 656378533, now seen corresponding path program 1 times [2022-11-23 02:51:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:51:34,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614807712] [2022-11-23 02:51:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:34,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:51:34,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:51:34,418 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:51:34,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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 (29)] Waiting until timeout for monitored process [2022-11-23 02:51:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:51:35,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 02:51:35,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:51:35,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:51:35,728 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 02:51:35,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 02:51:35,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:51:35,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 02:51:35,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_67 (_ 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_67 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_67) (_ bv1 1))))) (exists ((v_ArrVal_5964 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5964) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:36,577 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_67 (_ 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_67 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_67) (_ bv1 1))))) (exists ((v_ArrVal_5980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5980)))) is different from true [2022-11-23 02:51:37,499 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_67 (_ 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_67 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_67) (_ bv1 1))))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:51:37,603 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:51:37,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:51:37,738 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:51:37,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:51:37,850 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:51:37,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:51:37,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 02:51:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-11-23 02:51:37,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:51:38,004 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6009) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 02:51:38,016 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6009 (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_6009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:51:38,036 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6009 (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~mem35#1.base| v_ArrVal_6008))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6009)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:51:38,051 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6009 (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_6008))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6009)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:51:38,381 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6055 (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_6055))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6008)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6009)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-23 02:51:38,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:51:38,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614807712] [2022-11-23 02:51:38,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614807712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:51:38,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2123972564] [2022-11-23 02:51:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:51:38,386 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 02:51:38,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 02:51:38,387 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 02:51:38,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-23 02:52:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:52:04,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-23 02:52:04,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:52:04,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:52:04,407 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 02:52:04,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 02:52:04,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:52:04,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 02:52:05,791 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_67 (_ 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_67 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_67) (_ bv1 1))))) (exists ((v_ArrVal_6465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6465) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:52:06,382 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:52:06,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:52:06,464 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:52:06,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 36 treesize of output 37 [2022-11-23 02:52:06,528 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:52:06,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:52:06,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 02:52:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 02:52:06,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:52:08,664 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6480 (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_6480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 02:52:08,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6479 (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_6479))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6480)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:52:08,713 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6479 (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_6479))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6480)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:52:09,054 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6479 (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_6526))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6479)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6480)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:52:09,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2123972564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:52:09,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:52:09,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2022-11-23 02:52:09,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251639658] [2022-11-23 02:52:09,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:52:09,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 02:52:09,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:52:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 02:52:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=24, NotChecked=468, Total=702 [2022-11-23 02:52:09,060 INFO L87 Difference]: Start difference. First operand 1435 states and 1608 transitions. Second operand has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 15 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:52:10,262 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5965))) (exists ((v_arrayElimCell_67 (_ 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_67 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_67) (_ bv1 1))))) (exists ((v_ArrVal_6465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6465) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5980)))) is different from true [2022-11-23 02:52:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:52:27,363 INFO L93 Difference]: Finished difference Result 1705 states and 1863 transitions. [2022-11-23 02:52:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:52:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 15 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-11-23 02:52:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:52:27,366 INFO L225 Difference]: With dead ends: 1705 [2022-11-23 02:52:27,366 INFO L226 Difference]: Without dead ends: 1705 [2022-11-23 02:52:27,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 139 SyntacticMatches, 87 SemanticMatches, 29 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=86, Invalid=214, Unknown=28, NotChecked=602, Total=930 [2022-11-23 02:52:27,367 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 1130 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 3949 mSolverCounterSat, 15 mSolverCounterUnsat, 1225 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 4242 SdHoareTripleChecker+Invalid, 11684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3949 IncrementalHoareTripleChecker+Invalid, 1225 IncrementalHoareTripleChecker+Unknown, 6495 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:52:27,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 4242 Invalid, 11684 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 3949 Invalid, 1225 Unknown, 6495 Unchecked, 18.0s Time] [2022-11-23 02:52:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2022-11-23 02:52:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1434. [2022-11-23 02:52:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 942 states have (on average 1.6804670912951167) internal successors, (1583), 1423 states have internal predecessors, (1583), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:52:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1607 transitions. [2022-11-23 02:52:27,388 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1607 transitions. Word has length 116 [2022-11-23 02:52:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:52:27,389 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1607 transitions. [2022-11-23 02:52:27,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 15 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:52:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1607 transitions. [2022-11-23 02:52:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-23 02:52:27,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:52:27,404 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:52:27,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-23 02:52:27,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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 (29)] Forceful destruction successful, exit code 0 [2022-11-23 02:52:27,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:52:27,827 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:52:27,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:52:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 656378534, now seen corresponding path program 1 times [2022-11-23 02:52:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:52:27,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584492876] [2022-11-23 02:52:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:52:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:52:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:52:27,829 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:52:27,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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-11-23 02:52:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:52:29,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-23 02:52:29,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:52:29,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-11-23 02:52:29,299 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 02:52:29,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 02:52:29,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:52:29,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:52:29,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:52:29,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 02:52:29,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 02:52:29,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910)))) is different from true [2022-11-23 02:52:29,671 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912)))) is different from true [2022-11-23 02:52:29,686 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6915))) (exists ((v_ArrVal_6914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6914)))) is different from true [2022-11-23 02:52:29,701 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6917) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6916)))) is different from true [2022-11-23 02:52:29,792 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922)))) is different from true [2022-11-23 02:52:29,845 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926)))) is different from true [2022-11-23 02:52:29,862 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32)))) is different from true [2022-11-23 02:52:29,879 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6931))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6930)))) is different from true [2022-11-23 02:52:29,934 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934)))) is different from true [2022-11-23 02:52:30,018 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:52:30,105 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:52:30,165 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:52:30,255 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956)))) is different from true [2022-11-23 02:52:30,270 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:52:30,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32)))) is different from true [2022-11-23 02:52:30,406 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969)))) is different from true [2022-11-23 02:52:30,419 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:52:30,540 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:52:30,556 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32)))) is different from true [2022-11-23 02:52:30,642 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987)))) is different from true [2022-11-23 02:52:30,655 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989)))) is different from true [2022-11-23 02:52:30,669 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990)))) is different from true [2022-11-23 02:52:30,719 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:52:30,769 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:52:30,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:52:30,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:52:30,914 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:52:30,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:52:30,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:52:31,053 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:52:31,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:52:31,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:52:31,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 02:52:31,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 02:52:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 759 not checked. [2022-11-23 02:52:31,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:52:31,367 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2022-11-23 02:52:31,407 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_6998 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 02:52:31,466 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6997 (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_6996) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6997))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6996) .cse2 v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-23 02:52:31,516 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_6998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6996) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6997))) (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_6996) .cse3 v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-23 02:52:32,616 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7090))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6997))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7091) .cse0 v_ArrVal_6996) .cse1 v_ArrVal_6998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7090))) (let ((.cse6 (select (select .cse7 |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_7091) .cse6 v_ArrVal_6996) (select (select (store .cse7 .cse6 v_ArrVal_6997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6998))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-23 02:52:32,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:52:32,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584492876] [2022-11-23 02:52:32,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584492876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:52:32,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [939581742] [2022-11-23 02:52:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:52:32,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 02:52:32,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 02:52:32,637 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 02:52:32,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-23 02:53:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:53:02,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-23 02:53:02,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:53:02,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:53:02,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:53:02,598 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 02:53:02,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 02:53:02,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:53:02,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:53:02,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-23 02:53:02,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 7 treesize of output 3 [2022-11-23 02:53:03,023 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:53:03,111 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:53:03,125 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:53:03,138 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:53:03,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7488))) (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487)))) is different from true [2022-11-23 02:53:03,162 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7490))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7489)))) is different from true [2022-11-23 02:53:03,174 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7492) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7491)))) is different from true [2022-11-23 02:53:03,236 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495)))) is different from true [2022-11-23 02:53:03,265 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498)))) is different from true [2022-11-23 02:53:03,280 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499)))) is different from true [2022-11-23 02:53:03,296 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7502))) (exists ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7501) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:53:03,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7503)))) is different from true [2022-11-23 02:53:03,326 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7506))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7505) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:53:03,342 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7507))) (exists ((v_ArrVal_7508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7508))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32)))) is different from true [2022-11-23 02:53:03,356 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7510)))) is different from true [2022-11-23 02:53:03,505 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32)))) is different from true [2022-11-23 02:53:03,523 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7520))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7519) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:53:03,842 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535)))) is different from true [2022-11-23 02:53:03,929 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541)))) is different from true [2022-11-23 02:53:03,979 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:53:03,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548)))) is different from true [2022-11-23 02:53:04,006 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7549))) (exists ((v_ArrVal_7550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7550)))) is different from true [2022-11-23 02:53:04,020 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7551) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7552)))) is different from true [2022-11-23 02:53:04,034 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7554))) (exists ((v_ArrVal_7553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7553) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32)))) is different from true [2022-11-23 02:53:04,087 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557)))) is different from true [2022-11-23 02:53:04,101 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:53:04,179 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:53:04,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:53:04,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:53:04,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:53:04,412 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 65 treesize of output 43 [2022-11-23 02:53:04,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:53:04,574 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:53:04,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:53:04,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:53:04,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-23 02:53:04,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:53:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2022-11-23 02:53:04,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:53:04,698 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7565) |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_7564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 02:53:04,729 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_7564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2022-11-23 02:53:04,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base|)) (.cse4 (bvadd |c_ULTIMATE.start_main_#t~mem35#1.offset| (_ bv16 32))) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7563 (_ BitVec 32)) (v_ArrVal_7562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse3 .cse4 v_ArrVal_7563)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7562) .cse0 v_ArrVal_7565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7563 (_ BitVec 32)) (v_ArrVal_7562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7562) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse3 .cse4 v_ArrVal_7563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-23 02:53:07,620 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7563 (_ BitVec 32)) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7657))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7656))) (store (store .cse1 .cse2 v_ArrVal_7562) (select (select (store .cse3 .cse2 (store (select .cse3 .cse2) (bvadd (_ bv16 32) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) v_ArrVal_7563)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7565))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7563 (_ BitVec 32)) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7657))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7656))) (let ((.cse8 (store .cse9 .cse6 (store (select .cse9 .cse6) (bvadd (_ bv16 32) (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) v_ArrVal_7563)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store .cse5 .cse6 v_ArrVal_7562) .cse7 v_ArrVal_7565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_7564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2022-11-23 02:53:07,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [939581742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:53:07,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:53:07,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 65 [2022-11-23 02:53:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884891834] [2022-11-23 02:53:07,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:53:07,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-23 02:53:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:53:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-23 02:53:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=348, Unknown=79, NotChecked=5394, Total=6006 [2022-11-23 02:53:07,647 INFO L87 Difference]: Start difference. First operand 1434 states and 1607 transitions. Second operand has 66 states, 63 states have (on average 3.253968253968254) internal successors, (205), 66 states have internal predecessors, (205), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:53:09,251 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910))) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926))) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:53:09,266 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7520))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7519) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535))) (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910))) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:53:09,282 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_6931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6931))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7520))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7519) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535))) (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6915))) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_ArrVal_6914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6914))) (exists ((v_ArrVal_6930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6930))) (exists ((v_ArrVal_7549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7549))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910))) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922))) (exists ((v_ArrVal_7550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7550))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:53:09,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_6931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6931))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7520))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7519) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535))) (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6915))) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547))) (exists ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6916))) (exists ((v_ArrVal_7488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7488))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_7551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7551) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_ArrVal_6914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6914))) (exists ((v_ArrVal_6930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6930))) (exists ((v_ArrVal_7549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7549))) (exists ((v_ArrVal_7552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7552))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7502))) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7501) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910))) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922))) (exists ((v_ArrVal_7550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7550))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:53:09,318 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_6931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6931))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_7554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7554))) (exists ((v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7490))) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7553) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7520))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7519) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7489))) (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535))) (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6915))) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547))) (exists ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6916))) (exists ((v_ArrVal_7488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7488))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_7551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7551) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_ArrVal_6914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6914))) (exists ((v_ArrVal_6930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6930))) (exists ((v_ArrVal_7549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7549))) (exists ((v_ArrVal_7552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7552))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7502))) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7501) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910))) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922))) (exists ((v_ArrVal_7550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7550))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7503))) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:53:09,337 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_6931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6931))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7506))) (exists ((v_ArrVal_7554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7554))) (exists ((v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7490))) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7553) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7520))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7519) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7489))) (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7492) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535))) (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6915))) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547))) (exists ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6916))) (exists ((v_ArrVal_7488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7488))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_7551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7551) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7505) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_ArrVal_6914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6914))) (exists ((v_ArrVal_6930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6930))) (exists ((v_ArrVal_7549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7549))) (exists ((v_ArrVal_7552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7552))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7502))) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7501) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_7491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7491))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910))) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922))) (exists ((v_ArrVal_7550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7550))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7503))) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:53:09,355 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7507))) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_ArrVal_7508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7508))) (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_6931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6931))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7506))) (exists ((v_ArrVal_7554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7554))) (exists ((v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7490))) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7553) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7520))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7519) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7489))) (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7492) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535))) (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6915))) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547))) (exists ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6916))) (exists ((v_ArrVal_7488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7488))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_7551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7551) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7505) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_ArrVal_6914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6914))) (exists ((v_ArrVal_6930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6930))) (exists ((v_ArrVal_7549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7549))) (exists ((v_ArrVal_7552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7552))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7502))) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7501) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_7491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7491))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910))) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922))) (exists ((v_ArrVal_7550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7550))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7503))) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:53:09,373 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6909))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6959 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6959) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7507))) (exists ((v_ArrVal_7475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7475))) (exists ((v_ArrVal_6988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6988))) (exists ((v_ArrVal_7508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7508))) (exists ((v_ArrVal_7500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7500))) (exists ((v_ArrVal_6935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6935))) (exists ((v_ArrVal_6931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6931))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_6980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6980))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6917) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6946))) (exists ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7506))) (exists ((v_ArrVal_7554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7554))) (exists ((v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7490))) (exists ((v_ArrVal_7518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7518))) (exists ((v_ArrVal_6981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6981))) (exists ((v_ArrVal_6928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6928))) (exists ((v_ArrVal_7497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7497))) (exists ((v_ArrVal_6929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6929))) (exists ((v_ArrVal_6941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6941))) (exists ((v_ArrVal_6911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6911) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7553) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7496) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7520))) (exists ((v_ArrVal_6962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6962))) (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_7519 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7519) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7489))) (exists ((v_ArrVal_6908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6908))) (exists ((v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7542))) (exists ((v_ArrVal_7504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7483) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7492) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7535))) (exists ((v_ArrVal_6913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6913))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_6979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6979) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6915))) (exists ((v_ArrVal_6978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6978) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6989))) (exists ((v_ArrVal_7499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7499))) (exists ((v_ArrVal_7495 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7495))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547))) (exists ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6916))) (exists ((v_ArrVal_7488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7488))) (exists ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6957))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6986))) (exists ((v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7487))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_7551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7551) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6934))) (exists ((v_ArrVal_7505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7505) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6991) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6990))) (exists ((v_ArrVal_6914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6914))) (exists ((v_ArrVal_6930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6930))) (exists ((v_ArrVal_7549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7549))) (exists ((v_ArrVal_7552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7552))) (exists ((v_ArrVal_7498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7498))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7485))) (exists ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6987))) (exists ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6956))) (exists ((v_ArrVal_6951 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6951) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7476 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7476) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7510))) (exists ((v_ArrVal_6940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6940) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6912))) (exists ((v_ArrVal_7484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7484) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6958 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6958) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7502))) (exists ((v_ArrVal_6923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6923))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548))) (exists ((v_ArrVal_7541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7541))) (exists ((v_ArrVal_6968 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6968) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7501) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6927))) (exists ((v_ArrVal_6970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6970))) (exists ((v_ArrVal_7491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7491))) (exists ((v_ArrVal_7486 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7486) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6969))) (exists ((v_ArrVal_6910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6910))) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6922))) (exists ((v_ArrVal_7550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7550))) (exists ((v_ArrVal_6926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6926))) (exists ((v_ArrVal_6971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7503))) (exists ((v_ArrVal_6950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6950)))) is different from true [2022-11-23 02:53:09,378 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_81 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_81) (_ bv44 32))) (exists ((v_ArrVal_6995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6995))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6994) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:53:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:53:36,625 INFO L93 Difference]: Finished difference Result 2255 states and 2457 transitions. [2022-11-23 02:53:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 02:53:36,625 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 3.253968253968254) internal successors, (205), 66 states have internal predecessors, (205), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2022-11-23 02:53:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:53:36,629 INFO L225 Difference]: With dead ends: 2255 [2022-11-23 02:53:36,630 INFO L226 Difference]: Without dead ends: 2255 [2022-11-23 02:53:36,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 133 SyntacticMatches, 41 SemanticMatches, 93 ConstructedPredicates, 67 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=280, Invalid=648, Unknown=96, NotChecked=7906, Total=8930 [2022-11-23 02:53:36,631 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 1703 mSDsluCounter, 4258 mSDsCounter, 0 mSdLazyCounter, 8541 mSolverCounterSat, 18 mSolverCounterUnsat, 1130 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 4917 SdHoareTripleChecker+Invalid, 106016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 8541 IncrementalHoareTripleChecker+Invalid, 1130 IncrementalHoareTripleChecker+Unknown, 96327 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2022-11-23 02:53:36,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 4917 Invalid, 106016 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 8541 Invalid, 1130 Unknown, 96327 Unchecked, 27.9s Time] [2022-11-23 02:53:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2022-11-23 02:53:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1433. [2022-11-23 02:53:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 942 states have (on average 1.6794055201698515) internal successors, (1582), 1422 states have internal predecessors, (1582), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:53:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1606 transitions. [2022-11-23 02:53:36,653 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1606 transitions. Word has length 116 [2022-11-23 02:53:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:53:36,653 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1606 transitions. [2022-11-23 02:53:36,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 3.253968253968254) internal successors, (205), 66 states have internal predecessors, (205), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 02:53:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1606 transitions. [2022-11-23 02:53:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-23 02:53:36,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:53:36,655 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:53:36,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-11-23 02:53:36,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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-11-23 02:53:37,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:53:37,069 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:53:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:53:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash -812936066, now seen corresponding path program 1 times [2022-11-23 02:53:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:53:37,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075255078] [2022-11-23 02:53:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:53:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:53:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:53:37,071 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:53:37,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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 (33)] Waiting until timeout for monitored process [2022-11-23 02:53:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:53:38,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-23 02:53:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:53:38,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:53:38,557 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 02:53:38,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 02:53:38,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:53:38,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 02:53:39,825 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_105 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (not (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_105) (_ bv1 1))))) (exists ((v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8082)))) is different from true [2022-11-23 02:53:40,358 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:53:40,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:53:40,493 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:53:40,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:53:40,605 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:53:40,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:53:40,730 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:53:40,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:53:40,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 02:53:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-23 02:53:40,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:53:42,973 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8098 (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_8098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 02:53:42,993 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8097 (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~mem36#1.base| v_ArrVal_8097))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8098)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:53:43,009 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8097 (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_8097))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8098)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:53:43,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8096 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8096))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8097)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8098)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:53:43,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8096 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8096))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8097)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8098)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:53:43,401 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8096 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8144))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8096)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8097)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8098)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:53:43,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:53:43,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075255078] [2022-11-23 02:53:43,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075255078] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:53:43,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [981197558] [2022-11-23 02:53:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:53:43,407 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 02:53:43,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 02:53:43,412 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 02:53:43,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-23 02:54:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:54:59,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-23 02:54:59,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:54:59,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 7 [2022-11-23 02:54:59,948 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 02:54:59,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 02:54:59,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:55:00,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 02:55:00,139 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_105 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (not (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_105) (_ bv1 1))))) (exists ((v_ArrVal_8539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8539)))) is different from true [2022-11-23 02:55:00,681 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_105 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (not (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_105) (_ bv1 1))))) (exists ((v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8552)))) is different from true [2022-11-23 02:55:00,893 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_105 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (not (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_105) (_ bv1 1))))) (exists ((v_ArrVal_8558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8558)))) is different from true [2022-11-23 02:55:00,997 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_105 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (not (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_105) (_ bv1 1))))) (exists ((v_ArrVal_8561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8561)))) is different from true [2022-11-23 02:55:01,388 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_105 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (not (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_105) (_ bv1 1))))) (exists ((v_ArrVal_8571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8571) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:55:01,912 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:55:01,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:55:01,997 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:55:01,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:55:02,065 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:55:02,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:55:02,145 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:55:02,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-23 02:55:02,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-23 02:55:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-11-23 02:55:02,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:55:02,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8585) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 02:55:02,221 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8585 (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_8585) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-23 02:55:02,242 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8584 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8585 (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~mem36#1.base| v_ArrVal_8584))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8585)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-23 02:55:02,261 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8584 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8585 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8584))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8585)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 02:55:02,287 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8584 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8585 (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~mem35#1.base| v_ArrVal_8583))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8584)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8585)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:55:02,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8584 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8585 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8583))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8584)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8585)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:55:02,675 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8584 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8585 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8631))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8583)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8584)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8585)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-23 02:55:02,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [981197558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:55:02,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:55:02,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 17 [2022-11-23 02:55:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319691917] [2022-11-23 02:55:02,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:55:02,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 02:55:02,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:55:02,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 02:55:02,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=172, Unknown=32, NotChecked=836, Total=1122 [2022-11-23 02:55:02,683 INFO L87 Difference]: Start difference. First operand 1433 states and 1606 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:55:03,991 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_105 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (not (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_105) (_ bv1 1))))) (exists ((v_ArrVal_8558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8558))) (exists ((v_ArrVal_8561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8561))) (exists ((v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8552))) (exists ((v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8082))) (exists ((v_ArrVal_8571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8052) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:55:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:55:21,812 INFO L93 Difference]: Finished difference Result 1703 states and 1861 transitions. [2022-11-23 02:55:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 02:55:21,815 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-11-23 02:55:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:55:21,818 INFO L225 Difference]: With dead ends: 1703 [2022-11-23 02:55:21,818 INFO L226 Difference]: Without dead ends: 1703 [2022-11-23 02:55:21,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 146 SyntacticMatches, 85 SemanticMatches, 36 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=103, Invalid=247, Unknown=36, NotChecked=1020, Total=1406 [2022-11-23 02:55:21,819 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 1127 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 4628 mSolverCounterSat, 15 mSolverCounterUnsat, 1065 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 4623 SdHoareTripleChecker+Invalid, 13143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4628 IncrementalHoareTripleChecker+Invalid, 1065 IncrementalHoareTripleChecker+Unknown, 7435 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2022-11-23 02:55:21,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 4623 Invalid, 13143 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 4628 Invalid, 1065 Unknown, 7435 Unchecked, 18.8s Time] [2022-11-23 02:55:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-11-23 02:55:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1432. [2022-11-23 02:55:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 942 states have (on average 1.678343949044586) internal successors, (1581), 1421 states have internal predecessors, (1581), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-23 02:55:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1605 transitions. [2022-11-23 02:55:21,846 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1605 transitions. Word has length 119 [2022-11-23 02:55:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:55:21,847 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1605 transitions. [2022-11-23 02:55:21,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 02:55:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1605 transitions. [2022-11-23 02:55:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-23 02:55:21,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:55:21,849 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:55:21,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-11-23 02:55:22,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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 (33)] Forceful destruction successful, exit code 0 [2022-11-23 02:55:22,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:55:22,273 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-11-23 02:55:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:55:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash -812936065, now seen corresponding path program 1 times [2022-11-23 02:55:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:55:22,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784333304] [2022-11-23 02:55:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:55:22,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:55:22,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:55:22,275 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:55:22,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/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 (35)] Waiting until timeout for monitored process [2022-11-23 02:55:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:55:23,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-23 02:55:23,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:55:23,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-23 02:55:23,878 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 02:55:23,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 02:55:23,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:55:23,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:55:23,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:55:24,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 02:55:24,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-23 02:55:24,210 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9032))) (exists ((v_ArrVal_9033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9033) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:55:24,223 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9034))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9035)))) is different from true [2022-11-23 02:55:24,270 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9038) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9039) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:55:24,316 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9043))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9042)))) is different from true [2022-11-23 02:55:24,329 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9045))) (exists ((v_ArrVal_9044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9044)))) is different from true [2022-11-23 02:55:24,342 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9046))) (exists ((v_ArrVal_9047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9047))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32)))) is different from true [2022-11-23 02:55:24,389 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9050))) (exists ((v_ArrVal_9051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9051) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:55:24,573 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9063) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9062)))) is different from true [2022-11-23 02:55:24,621 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9067))) (exists ((v_ArrVal_9066 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9066))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32)))) is different from true [2022-11-23 02:55:24,811 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9078 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9078) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9079)))) is different from true [2022-11-23 02:55:24,825 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9081) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9080)))) is different from true [2022-11-23 02:55:24,838 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9082))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9083) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:55:24,960 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9091))) (exists ((v_ArrVal_9090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9090) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:55:25,009 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9095 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9095))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9094)))) is different from true [2022-11-23 02:55:25,022 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9096 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9096))) (exists ((v_ArrVal_9097 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9097))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32)))) is different from true [2022-11-23 02:55:25,069 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9100) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9101 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9101)))) is different from true [2022-11-23 02:55:25,082 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9102 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9102))) (exists ((v_ArrVal_9103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9103))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32)))) is different from true [2022-11-23 02:55:25,095 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9104 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9104) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9105 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9105) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:55:25,108 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9106))) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9107 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9107)))) is different from true [2022-11-23 02:55:25,121 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9109) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9108) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-23 02:55:25,169 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_121 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_121) (_ bv44 32))) (exists ((v_ArrVal_9112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9112))) (exists ((v_ArrVal_9113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9113) |c_#memory_$Pointer$.base|))) is different from true [2022-11-23 02:55:25,252 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:55:25,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:55:25,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:55:25,404 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:55:25,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:55:25,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:55:25,528 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:55:25,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:55:25,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:55:25,661 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:55:25,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-23 02:55:25,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-23 02:55:25,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-23 02:55:25,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 02:55:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 714 not checked. [2022-11-23 02:55:25,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:55:25,960 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9120 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-23 02:55:25,994 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_9121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9120 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-23 02:55:26,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9118))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9119) .cse0 v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9119) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2022-11-23 02:55:26,104 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_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9118))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9119) .cse1 v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9119) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2022-11-23 02:55:26,174 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9116))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9118))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9117) .cse0 v_ArrVal_9119) .cse1 v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9116))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9117) .cse6 v_ArrVal_9119) (select (select (store .cse7 .cse6 v_ArrVal_9118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9121))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2022-11-23 02:55:26,238 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (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|) .cse3))) (and (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9116))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9118))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9117) .cse1 v_ArrVal_9119) .cse2 v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9116))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9117) .cse7 v_ArrVal_9119) (select (select (store .cse8 .cse7 v_ArrVal_9118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9121))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2022-11-23 02:55:27,248 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9212 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9212))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9116))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9213) .cse1 v_ArrVal_9117) .cse2 v_ArrVal_9119) (select (select (store .cse3 .cse2 v_ArrVal_9118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9121))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9212 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9212))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9116))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9118))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9213) .cse6 v_ArrVal_9117) .cse7 v_ArrVal_9119) .cse8 v_ArrVal_9121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2022-11-23 02:55:27,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:55:27,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784333304] [2022-11-23 02:55:27,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784333304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:55:27,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [521087353] [2022-11-23 02:55:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:55:27,270 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 02:55:27,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 [2022-11-23 02:55:27,271 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 02:55:27,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_559ef90d-06c4-402e-9973-949c4d67f4f3/bin/uautomizer-QkZJyEgLgS/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process