./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:36:44,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:36:44,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:36:44,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:36:44,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:36:44,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:36:44,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:36:44,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:36:44,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:36:44,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:36:44,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:36:44,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:36:44,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:36:44,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:36:44,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:36:44,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:36:44,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:36:44,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:36:44,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:36:44,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:36:44,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:36:44,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:36:44,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:36:44,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:36:44,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:36:44,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:36:44,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:36:44,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:36:44,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:36:44,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:36:44,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:36:44,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:36:44,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:36:44,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:36:44,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:36:44,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:36:44,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:36:44,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:36:44,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:36:44,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:36:44,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:36:44,949 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-25 18:36:45,012 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:36:45,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:36:45,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:36:45,022 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:36:45,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:36:45,023 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:36:45,024 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:36:45,024 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:36:45,024 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:36:45,025 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:36:45,026 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:36:45,027 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:36:45,027 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:36:45,027 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:36:45,028 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:36:45,028 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:36:45,028 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:36:45,029 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:36:45,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 18:36:45,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 18:36:45,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:36:45,031 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:36:45,031 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 18:36:45,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:36:45,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:36:45,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:36:45,035 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 18:36:45,035 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 18:36:45,035 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 18:36:45,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:36:45,036 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 18:36:45,037 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:36:45,037 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:36:45,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:36:45,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:36:45,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:36:45,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:36:45,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:36:45,039 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:36:45,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:36:45,040 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:36:45,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:36:45,040 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/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_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2021-11-25 18:36:45,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:36:45,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:36:45,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:36:45,393 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:36:45,394 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:36:45,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2021-11-25 18:36:45,479 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data/21565fc50/b0e468d8c3634d259cb3c8aae20c4b9e/FLAG1e62dc576 [2021-11-25 18:36:46,301 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:36:46,302 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2021-11-25 18:36:46,323 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data/21565fc50/b0e468d8c3634d259cb3c8aae20c4b9e/FLAG1e62dc576 [2021-11-25 18:36:46,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data/21565fc50/b0e468d8c3634d259cb3c8aae20c4b9e [2021-11-25 18:36:46,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:36:46,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:36:46,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:36:46,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:36:46,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:36:46,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:36:46" (1/1) ... [2021-11-25 18:36:46,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73dea17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:46, skipping insertion in model container [2021-11-25 18:36:46,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:36:46" (1/1) ... [2021-11-25 18:36:46,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:36:46,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:36:47,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2021-11-25 18:36:47,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:36:47,276 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-11-25 18:36:47,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@a538c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:47, skipping insertion in model container [2021-11-25 18:36:47,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:36:47,279 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-25 18:36:47,283 INFO L158 Benchmark]: Toolchain (without parser) took 817.16ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 55.2MB in the beginning and 82.5MB in the end (delta: -27.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 18:36:47,285 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 30.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:36:47,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 813.58ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 55.0MB in the beginning and 82.5MB in the end (delta: -27.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 18:36:47,291 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.35ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 30.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 813.58ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 55.0MB in the beginning and 82.5MB in the end (delta: -27.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:36:50,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:36:50,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:36:50,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:36:50,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:36:50,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:36:50,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:36:50,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:36:50,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:36:50,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:36:50,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:36:50,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:36:50,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:36:50,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:36:50,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:36:50,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:36:50,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:36:50,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:36:50,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:36:50,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:36:50,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:36:50,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:36:50,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:36:50,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:36:50,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:36:50,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:36:50,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:36:50,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:36:50,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:36:50,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:36:50,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:36:50,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:36:50,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:36:50,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:36:50,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:36:50,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:36:50,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:36:50,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:36:50,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:36:50,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:36:50,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:36:50,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-25 18:36:50,359 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:36:50,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:36:50,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:36:50,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:36:50,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:36:50,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:36:50,363 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:36:50,363 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:36:50,363 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:36:50,364 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:36:50,365 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:36:50,365 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:36:50,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 18:36:50,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 18:36:50,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:36:50,368 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:36:50,369 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 18:36:50,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:36:50,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:36:50,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:36:50,370 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 18:36:50,370 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 18:36:50,370 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-25 18:36:50,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:36:50,371 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 18:36:50,371 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-25 18:36:50,371 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-25 18:36:50,372 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:36:50,372 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:36:50,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:36:50,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-25 18:36:50,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:36:50,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:36:50,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:36:50,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:36:50,375 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-25 18:36:50,375 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-25 18:36:50,375 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:36:50,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:36:50,376 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/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_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2021-11-25 18:36:50,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:36:50,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:36:50,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:36:50,972 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:36:50,972 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:36:50,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2021-11-25 18:36:51,072 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data/ed7eb74a8/95edc9a8015b4a8dbc85553ed93dc197/FLAGfe8630807 [2021-11-25 18:36:51,932 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:36:51,935 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2021-11-25 18:36:51,962 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data/ed7eb74a8/95edc9a8015b4a8dbc85553ed93dc197/FLAGfe8630807 [2021-11-25 18:36:52,008 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/data/ed7eb74a8/95edc9a8015b4a8dbc85553ed93dc197 [2021-11-25 18:36:52,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:36:52,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:36:52,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:36:52,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:36:52,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:36:52,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:36:52" (1/1) ... [2021-11-25 18:36:52,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da2a503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:52, skipping insertion in model container [2021-11-25 18:36:52,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:36:52" (1/1) ... [2021-11-25 18:36:52,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:36:52,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:36:52,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2021-11-25 18:36:52,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:36:52,874 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-25 18:36:52,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:36:52,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2021-11-25 18:36:52,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:36:52,959 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:36:52,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i[33021,33034] [2021-11-25 18:36:53,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:36:53,107 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:36:53,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53 WrapperNode [2021-11-25 18:36:53,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:36:53,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:36:53,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:36:53,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:36:53,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,205 INFO L137 Inliner]: procedures = 180, calls = 186, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 628 [2021-11-25 18:36:53,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:36:53,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:36:53,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:36:53,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:36:53,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:36:53,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:36:53,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:36:53,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:36:53,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (1/1) ... [2021-11-25 18:36:53,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:36:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:36:53,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:36:53,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:36:53,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-25 18:36:53,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-25 18:36:53,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-25 18:36:53,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-25 18:36:53,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-25 18:36:53,428 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-25 18:36:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 18:36:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:36:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:36:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 18:36:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 18:36:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:36:53,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-25 18:36:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-25 18:36:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:36:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:36:53,693 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:36:53,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:36:53,727 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-25 18:36:56,808 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:36:56,833 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:36:56,833 INFO L301 CfgBuilder]: Removed 31 assume(true) statements. [2021-11-25 18:36:56,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:36:56 BoogieIcfgContainer [2021-11-25 18:36:56,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:36:56,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:36:56,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:36:56,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:36:56,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:36:52" (1/3) ... [2021-11-25 18:36:56,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30446c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:36:56, skipping insertion in model container [2021-11-25 18:36:56,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:36:53" (2/3) ... [2021-11-25 18:36:56,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30446c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:36:56, skipping insertion in model container [2021-11-25 18:36:56,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:36:56" (3/3) ... [2021-11-25 18:36:56,847 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-1.i [2021-11-25 18:36:56,853 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:36:56,853 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2021-11-25 18:36:56,908 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:36:56,917 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:36:56,917 INFO L340 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2021-11-25 18:36:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 668 states, 325 states have (on average 2.230769230769231) internal successors, (725), 662 states have internal predecessors, (725), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:36:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:36:56,963 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:56,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:36:56,964 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:36:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2021-11-25 18:36:56,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:36:56,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194523083] [2021-11-25 18:36:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:56,991 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:36:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:36:57,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:36:57,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-25 18:36:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:57,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-25 18:36:57,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:57,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:36:57,283 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:36:57,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194523083] [2021-11-25 18:36:57,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194523083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:36:57,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:36:57,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:36:57,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814142844] [2021-11-25 18:36:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:36:57,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 18:36:57,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:36:57,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 18:36:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 18:36:57,358 INFO L87 Difference]: Start difference. First operand has 668 states, 325 states have (on average 2.230769230769231) internal successors, (725), 662 states have internal predecessors, (725), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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) [2021-11-25 18:36:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:57,458 INFO L93 Difference]: Finished difference Result 659 states and 706 transitions. [2021-11-25 18:36:57,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 18:36:57,461 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 [2021-11-25 18:36:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:57,485 INFO L225 Difference]: With dead ends: 659 [2021-11-25 18:36:57,486 INFO L226 Difference]: Without dead ends: 657 [2021-11-25 18:36:57,488 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:36:57,492 INFO L933 BasicCegarLoop]: 706 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, 706 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 [2021-11-25 18:36:57,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:36:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-11-25 18:36:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2021-11-25 18:36:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 320 states have (on average 2.11875) internal successors, (678), 651 states have internal predecessors, (678), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:36:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 704 transitions. [2021-11-25 18:36:57,645 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 704 transitions. Word has length 5 [2021-11-25 18:36:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:57,646 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 704 transitions. [2021-11-25 18:36:57,647 INFO L471 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) [2021-11-25 18:36:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 704 transitions. [2021-11-25 18:36:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:36:57,648 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:57,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:36:57,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:36:57,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:36:57,867 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:36:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:36:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2021-11-25 18:36:57,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:36:57,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726338889] [2021-11-25 18:36:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:36:57,874 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:36:57,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:36:57,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:36:57,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-25 18:36:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:36:58,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 18:36:58,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:36:58,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:36:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:36:58,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:36:58,179 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:36:58,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726338889] [2021-11-25 18:36:58,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726338889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:36:58,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:36:58,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:36:58,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627535621] [2021-11-25 18:36:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:36:58,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:36:58,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:36:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:36:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:36:58,187 INFO L87 Difference]: Start difference. First operand 657 states and 704 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) [2021-11-25 18:36:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:36:59,862 INFO L93 Difference]: Finished difference Result 615 states and 663 transitions. [2021-11-25 18:36:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:36:59,863 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 [2021-11-25 18:36:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:36:59,869 INFO L225 Difference]: With dead ends: 615 [2021-11-25 18:36:59,870 INFO L226 Difference]: Without dead ends: 615 [2021-11-25 18:36:59,870 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:36:59,872 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 596 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:36:59,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [609 Valid, 351 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-25 18:36:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-11-25 18:36:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 608. [2021-11-25 18:36:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 320 states have (on average 1.965625) internal successors, (629), 602 states have internal predecessors, (629), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:36:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 655 transitions. [2021-11-25 18:36:59,895 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 655 transitions. Word has length 5 [2021-11-25 18:36:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:36:59,896 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 655 transitions. [2021-11-25 18:36:59,896 INFO L471 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) [2021-11-25 18:36:59,896 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 655 transitions. [2021-11-25 18:36:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:36:59,897 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:36:59,897 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:36:59,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:00,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:00,108 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2021-11-25 18:37:00,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:00,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939253024] [2021-11-25 18:37:00,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:00,112 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:00,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:00,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:00,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-25 18:37:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:00,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 18:37:00,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:00,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:00,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:00,259 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:00,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939253024] [2021-11-25 18:37:00,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939253024] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:00,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:00,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:37:00,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619118515] [2021-11-25 18:37:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:00,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:37:00,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:37:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:37:00,262 INFO L87 Difference]: Start difference. First operand 608 states and 655 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) [2021-11-25 18:37:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:02,414 INFO L93 Difference]: Finished difference Result 675 states and 726 transitions. [2021-11-25 18:37:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:37:02,415 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 [2021-11-25 18:37:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:02,421 INFO L225 Difference]: With dead ends: 675 [2021-11-25 18:37:02,421 INFO L226 Difference]: Without dead ends: 675 [2021-11-25 18:37:02,422 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:02,424 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 254 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:02,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 752 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:37:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2021-11-25 18:37:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 630. [2021-11-25 18:37:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 352 states have (on average 1.9460227272727273) internal successors, (685), 624 states have internal predecessors, (685), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 711 transitions. [2021-11-25 18:37:02,468 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 711 transitions. Word has length 5 [2021-11-25 18:37:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:02,469 INFO L470 AbstractCegarLoop]: Abstraction has 630 states and 711 transitions. [2021-11-25 18:37:02,469 INFO L471 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) [2021-11-25 18:37:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 711 transitions. [2021-11-25 18:37:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 18:37:02,470 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:02,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 18:37:02,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:02,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:02,672 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1156735106, now seen corresponding path program 1 times [2021-11-25 18:37:02,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:02,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491803780] [2021-11-25 18:37:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:02,674 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:02,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:02,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:02,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-25 18:37:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:02,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 18:37:02,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:02,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:02,804 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491803780] [2021-11-25 18:37:02,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491803780] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:02,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:02,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:37:02,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607612594] [2021-11-25 18:37:02,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:02,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:37:02,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:37:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:37:02,817 INFO L87 Difference]: Start difference. First operand 630 states and 711 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) [2021-11-25 18:37:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:02,924 INFO L93 Difference]: Finished difference Result 1211 states and 1353 transitions. [2021-11-25 18:37:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:37:02,929 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 [2021-11-25 18:37:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:02,938 INFO L225 Difference]: With dead ends: 1211 [2021-11-25 18:37:02,939 INFO L226 Difference]: Without dead ends: 1211 [2021-11-25 18:37:02,939 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:02,940 INFO L933 BasicCegarLoop]: 866 mSDtfsCounter, 569 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:02,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 1505 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:37:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-11-25 18:37:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 631. [2021-11-25 18:37:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 353 states have (on average 1.9433427762039661) internal successors, (686), 625 states have internal predecessors, (686), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 712 transitions. [2021-11-25 18:37:02,972 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 712 transitions. Word has length 6 [2021-11-25 18:37:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:02,973 INFO L470 AbstractCegarLoop]: Abstraction has 631 states and 712 transitions. [2021-11-25 18:37:02,973 INFO L471 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) [2021-11-25 18:37:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 712 transitions. [2021-11-25 18:37:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 18:37:02,974 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:02,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:02,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:03,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:03,187 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2021-11-25 18:37:03,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:03,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206892891] [2021-11-25 18:37:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:03,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:03,190 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:03,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-25 18:37:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:03,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 18:37:03,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:03,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:03,376 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:03,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206892891] [2021-11-25 18:37:03,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206892891] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:03,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:03,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:37:03,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997832344] [2021-11-25 18:37:03,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:03,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:37:03,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:03,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:37:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:37:03,379 INFO L87 Difference]: Start difference. First operand 631 states and 712 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) [2021-11-25 18:37:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:03,424 INFO L93 Difference]: Finished difference Result 595 states and 675 transitions. [2021-11-25 18:37:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:37:03,425 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 [2021-11-25 18:37:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:03,430 INFO L225 Difference]: With dead ends: 595 [2021-11-25 18:37:03,430 INFO L226 Difference]: Without dead ends: 595 [2021-11-25 18:37:03,431 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:03,432 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 563 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 627 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 [2021-11-25 18:37:03,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 627 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:37:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-11-25 18:37:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 589. [2021-11-25 18:37:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 335 states have (on average 1.9194029850746268) internal successors, (643), 583 states have internal predecessors, (643), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 669 transitions. [2021-11-25 18:37:03,454 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 669 transitions. Word has length 11 [2021-11-25 18:37:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:03,455 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 669 transitions. [2021-11-25 18:37:03,455 INFO L471 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) [2021-11-25 18:37:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 669 transitions. [2021-11-25 18:37:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:37:03,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:03,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:03,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:03,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:03,672 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:03,673 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2021-11-25 18:37:03,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:03,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200265797] [2021-11-25 18:37:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:03,674 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:03,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:03,676 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:03,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-25 18:37:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:03,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 18:37:03,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:03,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:03,888 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:03,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200265797] [2021-11-25 18:37:03,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200265797] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:03,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:03,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:37:03,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850427799] [2021-11-25 18:37:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:03,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:37:03,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:03,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:37:03,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:37:03,891 INFO L87 Difference]: Start difference. First operand 589 states and 669 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) [2021-11-25 18:37:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:03,987 INFO L93 Difference]: Finished difference Result 574 states and 647 transitions. [2021-11-25 18:37:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:37:03,988 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 [2021-11-25 18:37:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:03,992 INFO L225 Difference]: With dead ends: 574 [2021-11-25 18:37:03,993 INFO L226 Difference]: Without dead ends: 574 [2021-11-25 18:37:03,993 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:03,996 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 534 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:03,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1127 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:37:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-11-25 18:37:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 567. [2021-11-25 18:37:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 327 states have (on average 1.8776758409785932) internal successors, (614), 561 states have internal predecessors, (614), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 640 transitions. [2021-11-25 18:37:04,017 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 640 transitions. Word has length 13 [2021-11-25 18:37:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:04,018 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 640 transitions. [2021-11-25 18:37:04,018 INFO L471 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) [2021-11-25 18:37:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 640 transitions. [2021-11-25 18:37:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 18:37:04,020 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:04,020 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:04,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:04,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:04,234 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:04,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2021-11-25 18:37:04,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:04,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902514604] [2021-11-25 18:37:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:04,235 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:04,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:04,236 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:04,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-25 18:37:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:04,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 18:37:04,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:04,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:04,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:04,550 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:04,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902514604] [2021-11-25 18:37:04,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902514604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:04,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:04,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:37:04,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888700417] [2021-11-25 18:37:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:04,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:37:04,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:37:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:37:04,553 INFO L87 Difference]: Start difference. First operand 567 states and 640 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) [2021-11-25 18:37:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:06,093 INFO L93 Difference]: Finished difference Result 611 states and 705 transitions. [2021-11-25 18:37:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:37:06,094 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 [2021-11-25 18:37:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:06,098 INFO L225 Difference]: With dead ends: 611 [2021-11-25 18:37:06,098 INFO L226 Difference]: Without dead ends: 611 [2021-11-25 18:37:06,099 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:06,099 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 960 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:06,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [970 Valid, 385 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-25 18:37:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-11-25 18:37:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 563. [2021-11-25 18:37:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 327 states have (on average 1.8654434250764527) internal successors, (610), 557 states have internal predecessors, (610), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 636 transitions. [2021-11-25 18:37:06,119 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 636 transitions. Word has length 27 [2021-11-25 18:37:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:06,120 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 636 transitions. [2021-11-25 18:37:06,120 INFO L471 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) [2021-11-25 18:37:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 636 transitions. [2021-11-25 18:37:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 18:37:06,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:06,121 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:06,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:06,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:06,334 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:06,335 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2021-11-25 18:37:06,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:06,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287290983] [2021-11-25 18:37:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:06,336 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:06,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:06,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-25 18:37:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:06,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:37:06,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:06,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:06,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:06,758 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:06,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287290983] [2021-11-25 18:37:06,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287290983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:06,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:06,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:37:06,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565364119] [2021-11-25 18:37:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:06,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:37:06,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:06,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:37:06,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:37:06,762 INFO L87 Difference]: Start difference. First operand 563 states and 636 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) [2021-11-25 18:37:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:09,052 INFO L93 Difference]: Finished difference Result 645 states and 708 transitions. [2021-11-25 18:37:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:37:09,054 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 [2021-11-25 18:37:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:09,059 INFO L225 Difference]: With dead ends: 645 [2021-11-25 18:37:09,059 INFO L226 Difference]: Without dead ends: 645 [2021-11-25 18:37:09,059 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:09,061 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 351 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:09,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 923 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-25 18:37:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-11-25 18:37:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 559. [2021-11-25 18:37:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 327 states have (on average 1.853211009174312) internal successors, (606), 553 states have internal predecessors, (606), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 632 transitions. [2021-11-25 18:37:09,083 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 632 transitions. Word has length 27 [2021-11-25 18:37:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:09,083 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 632 transitions. [2021-11-25 18:37:09,084 INFO L471 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) [2021-11-25 18:37:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 632 transitions. [2021-11-25 18:37:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-25 18:37:09,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:09,086 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:09,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:09,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:09,309 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2021-11-25 18:37:09,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:09,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186226050] [2021-11-25 18:37:09,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:09,311 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:09,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:09,313 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:09,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-25 18:37:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:09,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 18:37:09,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:09,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:09,701 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:09,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186226050] [2021-11-25 18:37:09,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186226050] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:09,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:09,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:37:09,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753681868] [2021-11-25 18:37:09,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:09,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:37:09,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:09,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:37:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:37:09,705 INFO L87 Difference]: Start difference. First operand 559 states and 632 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) [2021-11-25 18:37:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:09,775 INFO L93 Difference]: Finished difference Result 559 states and 628 transitions. [2021-11-25 18:37:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:37:09,776 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 [2021-11-25 18:37:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:09,781 INFO L225 Difference]: With dead ends: 559 [2021-11-25 18:37:09,781 INFO L226 Difference]: Without dead ends: 559 [2021-11-25 18:37:09,781 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:09,785 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 510 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:09,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1105 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:37:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-11-25 18:37:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 553. [2021-11-25 18:37:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 321 states have (on average 1.8566978193146417) internal successors, (596), 547 states have internal predecessors, (596), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 622 transitions. [2021-11-25 18:37:09,810 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 622 transitions. Word has length 42 [2021-11-25 18:37:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:09,814 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 622 transitions. [2021-11-25 18:37:09,814 INFO L471 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) [2021-11-25 18:37:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 622 transitions. [2021-11-25 18:37:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-25 18:37:09,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:09,822 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:09,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:10,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:10,040 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:10,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2021-11-25 18:37:10,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:10,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520806454] [2021-11-25 18:37:10,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:10,042 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:10,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:10,044 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:10,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-25 18:37:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:10,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 18:37:10,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:10,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:10,692 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:10,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520806454] [2021-11-25 18:37:10,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520806454] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:10,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:10,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:37:10,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799387249] [2021-11-25 18:37:10,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:10,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:37:10,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:10,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:37:10,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:37:10,694 INFO L87 Difference]: Start difference. First operand 553 states and 622 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) [2021-11-25 18:37:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:10,804 INFO L93 Difference]: Finished difference Result 599 states and 668 transitions. [2021-11-25 18:37:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:37:10,805 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 [2021-11-25 18:37:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:10,810 INFO L225 Difference]: With dead ends: 599 [2021-11-25 18:37:10,810 INFO L226 Difference]: Without dead ends: 599 [2021-11-25 18:37:10,810 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:10,811 INFO L933 BasicCegarLoop]: 554 mSDtfsCounter, 67 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:10,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1012 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:37:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-25 18:37:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2021-11-25 18:37:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 367 states have (on average 1.7493188010899183) internal successors, (642), 593 states have internal predecessors, (642), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 668 transitions. [2021-11-25 18:37:10,831 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 668 transitions. Word has length 50 [2021-11-25 18:37:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:10,832 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 668 transitions. [2021-11-25 18:37:10,832 INFO L471 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) [2021-11-25 18:37:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 668 transitions. [2021-11-25 18:37:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-25 18:37:10,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:10,834 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:10,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:11,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:11,048 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2021-11-25 18:37:11,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:11,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610016742] [2021-11-25 18:37:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:11,050 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:11,056 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:11,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-25 18:37:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:11,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 18:37:11,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:11,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:11,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:12,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:37:12,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-25 18:37:12,272 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 18:37:12,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-11-25 18:37:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:12,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:12,301 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:12,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610016742] [2021-11-25 18:37:12,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610016742] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:12,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:12,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:37:12,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970113304] [2021-11-25 18:37:12,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:12,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:37:12,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:12,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:37:12,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:37:12,304 INFO L87 Difference]: Start difference. First operand 599 states and 668 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) [2021-11-25 18:37:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:13,999 INFO L93 Difference]: Finished difference Result 568 states and 638 transitions. [2021-11-25 18:37:14,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:37:14,001 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 [2021-11-25 18:37:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:14,005 INFO L225 Difference]: With dead ends: 568 [2021-11-25 18:37:14,005 INFO L226 Difference]: Without dead ends: 568 [2021-11-25 18:37:14,005 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:14,006 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 827 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:14,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [830 Valid, 260 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-25 18:37:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-11-25 18:37:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 529. [2021-11-25 18:37:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 335 states have (on average 1.6059701492537313) internal successors, (538), 523 states have internal predecessors, (538), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 564 transitions. [2021-11-25 18:37:14,024 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 564 transitions. Word has length 53 [2021-11-25 18:37:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:14,025 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 564 transitions. [2021-11-25 18:37:14,025 INFO L471 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) [2021-11-25 18:37:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 564 transitions. [2021-11-25 18:37:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-25 18:37:14,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:14,030 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:14,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:14,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:14,244 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:14,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2021-11-25 18:37:14,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:14,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793856092] [2021-11-25 18:37:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:14,246 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:14,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:14,247 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:14,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-25 18:37:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:14,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 18:37:14,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:14,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:14,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:37:14,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-11-25 18:37:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:14,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:14,732 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:14,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793856092] [2021-11-25 18:37:14,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793856092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:14,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:14,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:37:14,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620495605] [2021-11-25 18:37:14,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:14,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:37:14,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:14,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:37:14,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:37:14,735 INFO L87 Difference]: Start difference. First operand 529 states and 564 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) [2021-11-25 18:37:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:16,785 INFO L93 Difference]: Finished difference Result 528 states and 563 transitions. [2021-11-25 18:37:16,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:37:16,785 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 [2021-11-25 18:37:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:16,789 INFO L225 Difference]: With dead ends: 528 [2021-11-25 18:37:16,790 INFO L226 Difference]: Without dead ends: 528 [2021-11-25 18:37:16,790 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:16,791 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 4 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:16,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1325 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-25 18:37:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-11-25 18:37:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2021-11-25 18:37:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 335 states have (on average 1.6029850746268657) internal successors, (537), 522 states have internal predecessors, (537), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 563 transitions. [2021-11-25 18:37:16,810 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 563 transitions. Word has length 58 [2021-11-25 18:37:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:16,810 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 563 transitions. [2021-11-25 18:37:16,811 INFO L471 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) [2021-11-25 18:37:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 563 transitions. [2021-11-25 18:37:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-25 18:37:16,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:16,812 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:16,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:17,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:17,029 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:17,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2021-11-25 18:37:17,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:17,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944932520] [2021-11-25 18:37:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:17,030 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:17,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:17,031 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:17,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-25 18:37:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:17,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:37:17,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:17,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:17,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:37:17,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:37:17,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-11-25 18:37:17,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 18:37:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:17,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:17,565 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:17,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944932520] [2021-11-25 18:37:17,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944932520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:17,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:17,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:37:17,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659894785] [2021-11-25 18:37:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:17,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:37:17,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:17,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:37:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:37:17,567 INFO L87 Difference]: Start difference. First operand 528 states and 563 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) [2021-11-25 18:37:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:19,739 INFO L93 Difference]: Finished difference Result 527 states and 562 transitions. [2021-11-25 18:37:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:37:19,739 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 [2021-11-25 18:37:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:19,743 INFO L225 Difference]: With dead ends: 527 [2021-11-25 18:37:19,743 INFO L226 Difference]: Without dead ends: 527 [2021-11-25 18:37:19,744 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:19,744 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 2 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:19,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1335 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-25 18:37:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-11-25 18:37:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2021-11-25 18:37:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 334 states have (on average 1.6047904191616766) internal successors, (536), 521 states have internal predecessors, (536), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2021-11-25 18:37:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 562 transitions. [2021-11-25 18:37:19,759 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 562 transitions. Word has length 58 [2021-11-25 18:37:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:19,760 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 562 transitions. [2021-11-25 18:37:19,760 INFO L471 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) [2021-11-25 18:37:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 562 transitions. [2021-11-25 18:37:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-25 18:37:19,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:19,761 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:19,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-25 18:37:19,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:19,975 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -624458498, now seen corresponding path program 1 times [2021-11-25 18:37:19,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159361723] [2021-11-25 18:37:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:19,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:19,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:19,978 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:19,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-25 18:37:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:20,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 18:37:20,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:20,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:37:20,317 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:20,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159361723] [2021-11-25 18:37:20,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159361723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:37:20,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:37:20,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:37:20,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850711802] [2021-11-25 18:37:20,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:37:20,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:37:20,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:20,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:37:20,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:37:20,319 INFO L87 Difference]: Start difference. First operand 527 states and 562 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) [2021-11-25 18:37:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:20,383 INFO L93 Difference]: Finished difference Result 530 states and 566 transitions. [2021-11-25 18:37:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:37:20,385 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 [2021-11-25 18:37:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:20,389 INFO L225 Difference]: With dead ends: 530 [2021-11-25 18:37:20,391 INFO L226 Difference]: Without dead ends: 530 [2021-11-25 18:37:20,391 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:37:20,392 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 2 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:20,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1531 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:37:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-11-25 18:37:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-11-25 18:37:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 336 states have (on average 1.6041666666666667) internal successors, (539), 524 states have internal predecessors, (539), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 18:37:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 566 transitions. [2021-11-25 18:37:20,410 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 566 transitions. Word has length 66 [2021-11-25 18:37:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:20,412 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 566 transitions. [2021-11-25 18:37:20,412 INFO L471 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) [2021-11-25 18:37:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 566 transitions. [2021-11-25 18:37:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-25 18:37:20,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:20,423 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:20,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:20,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:20,643 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash -594716233, now seen corresponding path program 1 times [2021-11-25 18:37:20,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558413348] [2021-11-25 18:37:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:20,645 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:20,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:20,646 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:20,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-25 18:37:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:20,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 18:37:20,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:20,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:21,164 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:21,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558413348] [2021-11-25 18:37:21,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558413348] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:21,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [32352778] [2021-11-25 18:37:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:21,165 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 18:37:21,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 18:37:21,167 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 18:37:21,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-11-25 18:37:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:21,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 18:37:21,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:21,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:21,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [32352778] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:21,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836452075] [2021-11-25 18:37:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:21,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:21,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:21,789 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:21,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 18:37:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:22,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 18:37:22,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:22,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:22,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836452075] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:22,279 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 18:37:22,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2021-11-25 18:37:22,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602917461] [2021-11-25 18:37:22,279 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:22,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:37:22,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:37:22,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:37:22,281 INFO L87 Difference]: Start difference. First operand 530 states and 566 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) [2021-11-25 18:37:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:22,442 INFO L93 Difference]: Finished difference Result 542 states and 583 transitions. [2021-11-25 18:37:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 18:37:22,443 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 [2021-11-25 18:37:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:22,446 INFO L225 Difference]: With dead ends: 542 [2021-11-25 18:37:22,447 INFO L226 Difference]: Without dead ends: 542 [2021-11-25 18:37:22,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:37:22,448 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 23 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:22,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1535 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:37:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-11-25 18:37:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2021-11-25 18:37:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 345 states have (on average 1.6057971014492753) internal successors, (554), 533 states have internal predecessors, (554), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 18:37:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 581 transitions. [2021-11-25 18:37:22,464 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 581 transitions. Word has length 67 [2021-11-25 18:37:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:22,465 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 581 transitions. [2021-11-25 18:37:22,465 INFO L471 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) [2021-11-25 18:37:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 581 transitions. [2021-11-25 18:37:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-25 18:37:22,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:22,466 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:37:22,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2021-11-25 18:37:22,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:22,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-11-25 18:37:23,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:37:23,071 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:23,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash 133393214, now seen corresponding path program 2 times [2021-11-25 18:37:23,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:23,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062645491] [2021-11-25 18:37:23,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 18:37:23,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:23,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:23,073 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:23,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-25 18:37:23,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 18:37:23,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:23,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 18:37:23,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:23,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:24,057 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:24,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062645491] [2021-11-25 18:37:24,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062645491] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:24,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1347352491] [2021-11-25 18:37:24,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 18:37:24,058 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 18:37:24,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 18:37:24,060 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 18:37:24,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-11-25 18:37:25,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 18:37:25,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:25,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-25 18:37:25,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:25,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:25,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1347352491] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:25,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784530558] [2021-11-25 18:37:25,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 18:37:25,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:25,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:25,663 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:25,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 18:37:40,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 18:37:40,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:40,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-25 18:37:40,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:40,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:37:40,556 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 18:37:40,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-11-25 18:37:40,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:37:41,145 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:37:41,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-11-25 18:37:41,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-11-25 18:37:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:37:41,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:41,500 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-11-25 18:37:41,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-11-25 18:37:41,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1262) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2021-11-25 18:37:41,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784530558] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:37:41,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2021-11-25 18:37:41,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2021-11-25 18:37:41,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801368437] [2021-11-25 18:37:41,516 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:41,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-25 18:37:41,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-25 18:37:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=467, Unknown=2, NotChecked=44, Total=600 [2021-11-25 18:37:41,519 INFO L87 Difference]: Start difference. First operand 540 states and 581 transitions. Second operand has 23 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-25 18:37:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:48,113 INFO L93 Difference]: Finished difference Result 609 states and 663 transitions. [2021-11-25 18:37:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 18:37:48,114 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 70 [2021-11-25 18:37:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:48,118 INFO L225 Difference]: With dead ends: 609 [2021-11-25 18:37:48,118 INFO L226 Difference]: Without dead ends: 605 [2021-11-25 18:37:48,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 322 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=305, Invalid=1743, Unknown=26, NotChecked=88, Total=2162 [2021-11-25 18:37:48,120 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 436 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:48,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 3519 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2927 Invalid, 0 Unknown, 308 Unchecked, 5.5s Time] [2021-11-25 18:37:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-11-25 18:37:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 544. [2021-11-25 18:37:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 350 states have (on average 1.5942857142857143) internal successors, (558), 537 states have internal predecessors, (558), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 18:37:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 585 transitions. [2021-11-25 18:37:48,141 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 585 transitions. Word has length 70 [2021-11-25 18:37:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:48,141 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 585 transitions. [2021-11-25 18:37:48,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-25 18:37:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 585 transitions. [2021-11-25 18:37:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-25 18:37:48,143 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:48,143 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:48,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:48,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:48,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-11-25 18:37:48,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:48,757 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1838662344, now seen corresponding path program 1 times [2021-11-25 18:37:48,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:48,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131203001] [2021-11-25 18:37:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:48,758 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:48,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:48,759 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:48,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-25 18:37:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:49,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:37:49,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:49,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:50,116 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:37:50,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131203001] [2021-11-25 18:37:50,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131203001] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:50,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [544302135] [2021-11-25 18:37:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:50,117 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 18:37:50,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 18:37:50,134 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 18:37:50,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-11-25 18:37:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:50,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 18:37:50,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:51,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:51,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [544302135] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:51,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349986950] [2021-11-25 18:37:51,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:37:51,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:51,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:37:51,272 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:37:51,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 18:37:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:37:51,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 18:37:51,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:51,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:37:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:52,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349986950] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:37:52,874 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 18:37:52,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 35 [2021-11-25 18:37:52,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458748573] [2021-11-25 18:37:52,875 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 18:37:52,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 18:37:52,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:37:52,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 18:37:52,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=808, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 18:37:52,880 INFO L87 Difference]: Start difference. First operand 544 states and 585 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 18:37:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:37:56,412 INFO L93 Difference]: Finished difference Result 585 states and 642 transitions. [2021-11-25 18:37:56,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 18:37:56,413 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 75 [2021-11-25 18:37:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:37:56,418 INFO L225 Difference]: With dead ends: 585 [2021-11-25 18:37:56,418 INFO L226 Difference]: Without dead ends: 579 [2021-11-25 18:37:56,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1371, Invalid=2789, Unknown=0, NotChecked=0, Total=4160 [2021-11-25 18:37:56,421 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 150 mSDsluCounter, 5678 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 6197 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:37:56,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 6197 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 18:37:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-11-25 18:37:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 563. [2021-11-25 18:37:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 369 states have (on average 1.5826558265582655) internal successors, (584), 556 states have internal predecessors, (584), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 18:37:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 611 transitions. [2021-11-25 18:37:56,453 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 611 transitions. Word has length 75 [2021-11-25 18:37:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:37:56,454 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 611 transitions. [2021-11-25 18:37:56,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 35 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 18:37:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 611 transitions. [2021-11-25 18:37:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-25 18:37:56,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:37:56,455 INFO L514 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:37:56,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:56,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:56,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 18:37:57,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:37:57,074 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:37:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:37:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 262128703, now seen corresponding path program 2 times [2021-11-25 18:37:57,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:37:57,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417021093] [2021-11-25 18:37:57,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 18:37:57,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:37:57,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:37:57,076 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:37:57,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-25 18:37:57,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 18:37:57,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:37:57,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-25 18:37:57,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:37:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:37:58,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:01,653 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:38:01,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417021093] [2021-11-25 18:38:01,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417021093] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:01,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1387987659] [2021-11-25 18:38:01,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 18:38:01,653 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 18:38:01,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 18:38:01,654 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 18:38:01,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2021-11-25 18:38:02,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 18:38:02,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:02,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-25 18:38:02,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:03,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:38:04,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1387987659] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:38:04,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770205102] [2021-11-25 18:38:04,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 18:38:04,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:38:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:38:04,423 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:38:04,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 18:38:23,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-25 18:38:23,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:38:23,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 18:38:23,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:38:23,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:38:23,470 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 18:38:23,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-11-25 18:38:23,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:38:23,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:38:23,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:38:24,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-25 18:38:24,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-25 18:38:24,466 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2322))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2321) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:38:24,484 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2323) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:38:24,503 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2325)))) is different from true [2021-11-25 18:38:24,529 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2327) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:38:24,545 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2330) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2329) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:38:24,885 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335)))) is different from true [2021-11-25 18:38:25,276 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:38:25,584 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:38:26,167 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2358) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2357) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:38:26,230 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:38:26,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 18:38:26,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 18:38:26,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-11-25 18:38:26,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 18:38:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 144 not checked. [2021-11-25 18:38:26,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:38:27,433 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2401) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2401 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2401) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2402) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 18:38:27,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770205102] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:38:27,442 INFO L186 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2021-11-25 18:38:27,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24, 24, 17] total 62 [2021-11-25 18:38:27,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277551993] [2021-11-25 18:38:27,442 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2021-11-25 18:38:27,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2021-11-25 18:38:27,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:38:27,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-25 18:38:27,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2365, Unknown=30, NotChecked=1150, Total=4160 [2021-11-25 18:38:27,447 INFO L87 Difference]: Start difference. First operand 563 states and 611 transitions. Second operand has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-25 18:38:56,856 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2320) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2341) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2322 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2322))) (exists ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2348))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_15) (_ bv44 32))) (exists ((v_ArrVal_2326 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2326) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2319) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2330) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2325 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2325))) (exists ((v_ArrVal_2329 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2329) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2358 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2358) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2328) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2323) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2342) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2336) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2327) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2335))) (exists ((v_ArrVal_2357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2357) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2321) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:39:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:39:14,522 INFO L93 Difference]: Finished difference Result 647 states and 733 transitions. [2021-11-25 18:39:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-25 18:39:14,524 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2021-11-25 18:39:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:39:14,528 INFO L225 Difference]: With dead ends: 647 [2021-11-25 18:39:14,528 INFO L226 Difference]: Without dead ends: 637 [2021-11-25 18:39:14,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 347 SyntacticMatches, 21 SemanticMatches, 135 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2886 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=2684, Invalid=12545, Unknown=565, NotChecked=2838, Total=18632 [2021-11-25 18:39:14,536 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 720 mSDsluCounter, 7275 mSDsCounter, 0 mSdLazyCounter, 8453 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 7572 SdHoareTripleChecker+Invalid, 14932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 8453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6404 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:39:14,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 7572 Invalid, 14932 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [75 Valid, 8453 Invalid, 0 Unknown, 6404 Unchecked, 16.3s Time] [2021-11-25 18:39:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-11-25 18:39:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 594. [2021-11-25 18:39:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 401 states have (on average 1.5486284289276808) internal successors, (621), 587 states have internal predecessors, (621), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 18:39:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 648 transitions. [2021-11-25 18:39:14,562 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 648 transitions. Word has length 86 [2021-11-25 18:39:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:39:14,562 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 648 transitions. [2021-11-25 18:39:14,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.0163934426229506) internal successors, (184), 62 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-25 18:39:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 648 transitions. [2021-11-25 18:39:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-25 18:39:14,564 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:39:14,564 INFO L514 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:39:14,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2021-11-25 18:39:14,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-11-25 18:39:15,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 18:39:15,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:15,172 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:39:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:39:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2061206434, now seen corresponding path program 1 times [2021-11-25 18:39:15,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:39:15,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54602067] [2021-11-25 18:39:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:15,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:39:15,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:39:15,174 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:39:15,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-25 18:39:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:15,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 18:39:15,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:17,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:23,381 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:39:23,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54602067] [2021-11-25 18:39:23,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54602067] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:23,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1440222410] [2021-11-25 18:39:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:23,382 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 18:39:23,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 18:39:23,383 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 18:39:23,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-11-25 18:39:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:24,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 18:39:24,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:24,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:25,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1440222410] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:25,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996259621] [2021-11-25 18:39:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:39:25,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:39:25,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:39:25,776 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:39:25,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 18:39:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:39:26,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 18:39:26,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:39:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:26,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:39:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:39:37,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996259621] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:39:37,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 18:39:37,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45, 45, 45, 45] total 131 [2021-11-25 18:39:37,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611595616] [2021-11-25 18:39:37,050 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 18:39:37,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2021-11-25 18:39:37,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:39:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2021-11-25 18:39:37,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4083, Invalid=12947, Unknown=0, NotChecked=0, Total=17030 [2021-11-25 18:39:37,060 INFO L87 Difference]: Start difference. First operand 594 states and 648 transitions. Second operand has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 18:42:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:08,174 INFO L93 Difference]: Finished difference Result 740 states and 855 transitions. [2021-11-25 18:42:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2021-11-25 18:42:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 110 [2021-11-25 18:42:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:08,179 INFO L225 Difference]: With dead ends: 740 [2021-11-25 18:42:08,179 INFO L226 Difference]: Without dead ends: 734 [2021-11-25 18:42:08,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 153.6s TimeCoverageRelationStatistics Valid=18292, Invalid=46478, Unknown=0, NotChecked=0, Total=64770 [2021-11-25 18:42:08,189 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 1065 mSDsluCounter, 24941 mSDsCounter, 0 mSdLazyCounter, 7104 mSolverCounterSat, 1441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 25489 SdHoareTripleChecker+Invalid, 8545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 7104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:08,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 25489 Invalid, 8545 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1441 Valid, 7104 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2021-11-25 18:42:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-11-25 18:42:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 658. [2021-11-25 18:42:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 465 states have (on average 1.5182795698924731) internal successors, (706), 651 states have internal predecessors, (706), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 18:42:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 733 transitions. [2021-11-25 18:42:08,214 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 733 transitions. Word has length 110 [2021-11-25 18:42:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:42:08,215 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 733 transitions. [2021-11-25 18:42:08,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-25 18:42:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 733 transitions. [2021-11-25 18:42:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-25 18:42:08,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:42:08,217 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:42:08,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-11-25 18:42:08,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2021-11-25 18:42:08,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-11-25 18:42:08,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:42:08,832 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:42:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:42:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash -207004553, now seen corresponding path program 2 times [2021-11-25 18:42:08,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:42:08,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795249686] [2021-11-25 18:42:08,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 18:42:08,834 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:42:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:42:08,835 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:42:08,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-11-25 18:42:09,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 18:42:09,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:42:09,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-25 18:42:09,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:42:09,620 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-11-25 18:42:09,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2021-11-25 18:42:09,694 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-25 18:42:09,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 19 [2021-11-25 18:42:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-25 18:42:09,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:42:09,718 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:42:09,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795249686] [2021-11-25 18:42:09,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795249686] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:42:09,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:42:09,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:42:09,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052799374] [2021-11-25 18:42:09,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:42:09,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:42:09,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:42:09,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:42:09,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:42:09,720 INFO L87 Difference]: Start difference. First operand 658 states and 733 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 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) [2021-11-25 18:42:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:42:11,509 INFO L93 Difference]: Finished difference Result 949 states and 1038 transitions. [2021-11-25 18:42:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:42:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-11-25 18:42:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:42:11,516 INFO L225 Difference]: With dead ends: 949 [2021-11-25 18:42:11,516 INFO L226 Difference]: Without dead ends: 949 [2021-11-25 18:42:11,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:42:11,517 INFO L933 BasicCegarLoop]: 566 mSDtfsCounter, 346 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:42:11,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 1636 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 599 Invalid, 0 Unknown, 212 Unchecked, 1.7s Time] [2021-11-25 18:42:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-11-25 18:42:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 657. [2021-11-25 18:42:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 465 states have (on average 1.5161290322580645) internal successors, (705), 650 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 18:42:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 732 transitions. [2021-11-25 18:42:11,538 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 732 transitions. Word has length 113 [2021-11-25 18:42:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:42:11,539 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 732 transitions. [2021-11-25 18:42:11,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 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) [2021-11-25 18:42:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 732 transitions. [2021-11-25 18:42:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-25 18:42:11,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:42:11,541 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:42:11,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-11-25 18:42:11,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 18:42:11,756 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:42:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:42:11,756 INFO L85 PathProgramCache]: Analyzing trace with hash -207004552, now seen corresponding path program 1 times [2021-11-25 18:42:11,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:42:11,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243398317] [2021-11-25 18:42:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:42:11,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:42:11,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:42:11,758 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:42:11,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-11-25 18:42:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:42:12,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 18:42:12,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:42:12,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:42:12,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:42:12,855 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 18:42:12,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-11-25 18:42:12,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:42:12,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:42:13,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-25 18:42:13,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-25 18:42:13,072 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:42:13,142 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:42:13,201 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:42:13,214 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:42:13,227 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:42:13,239 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163)))) is different from true [2021-11-25 18:42:13,346 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:42:13,389 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:42:13,404 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:42:13,418 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:42:13,431 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:42:13,476 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:42:13,488 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:42:13,501 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:42:13,586 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194)))) is different from true [2021-11-25 18:42:13,600 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:42:13,698 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203)))) is different from true [2021-11-25 18:42:13,711 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:42:13,818 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2021-11-25 18:42:13,830 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214)))) is different from true [2021-11-25 18:42:13,845 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:42:13,858 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:42:13,994 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:42:14,039 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232)))) is different from true [2021-11-25 18:42:14,141 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:42:14,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 18:42:14,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 18:42:14,296 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:42:14,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 18:42:14,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 18:42:14,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 18:42:14,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-11-25 18:42:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2021-11-25 18:42:14,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:42:14,565 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4236) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4236) |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_4237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 18:42:14,618 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 18:42:15,468 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4328)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4329) .cse0 v_ArrVal_4236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4329) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_4236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))) is different from false [2021-11-25 18:42:15,483 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:42:15,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243398317] [2021-11-25 18:42:15,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243398317] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:42:15,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1785865583] [2021-11-25 18:42:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:42:15,484 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 18:42:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 18:42:15,488 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 18:42:15,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2021-11-25 18:44:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:12,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 113 conjunts are in the unsatisfiable core [2021-11-25 18:44:12,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:12,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:44:13,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:44:13,134 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 18:44:13,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-11-25 18:44:13,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:44:13,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:44:13,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-25 18:44:13,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-25 18:44:13,297 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:13,313 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4697 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4697) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4696)))) is different from true [2021-11-25 18:44:13,328 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,344 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,396 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705)))) is different from true [2021-11-25 18:44:13,412 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,427 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:13,443 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:13,459 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712)))) is different from true [2021-11-25 18:44:13,475 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714)))) is different from true [2021-11-25 18:44:13,528 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:13,612 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,832 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,848 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738))) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,864 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,917 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:13,932 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,948 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749))) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:13,964 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:13,979 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:14,037 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:14,054 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:14,111 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763)))) is different from true [2021-11-25 18:44:14,164 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:14,180 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:14,274 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:14,290 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:14,348 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:14,404 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:44:14,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 18:44:14,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 18:44:14,492 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:44:14,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 18:44:14,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 18:44:14,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 18:44:14,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-11-25 18:44:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2021-11-25 18:44:14,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:44:14,646 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-11-25 18:44:14,686 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 18:44:15,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4874) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4875)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4874) .cse2 v_ArrVal_4782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_4783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 18:44:15,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1785865583] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:15,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470252757] [2021-11-25 18:44:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:15,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:15,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:44:15,446 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:44:15,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 18:44:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:16,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 112 conjunts are in the unsatisfiable core [2021-11-25 18:44:16,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:16,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:44:16,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:44:16,219 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 18:44:16,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-11-25 18:44:16,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:44:16,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:44:16,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-25 18:44:16,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-11-25 18:44:16,389 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5241) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240)))) is different from true [2021-11-25 18:44:16,405 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5243) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5242 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5242) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:16,466 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:16,511 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250)))) is different from true [2021-11-25 18:44:16,533 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:16,547 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:16,560 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257)))) is different from true [2021-11-25 18:44:16,679 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264)))) is different from true [2021-11-25 18:44:16,691 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:16,702 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:16,723 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:16,789 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:16,896 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:17,074 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:17,170 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306)))) is different from true [2021-11-25 18:44:17,182 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:17,247 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2021-11-25 18:44:17,272 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:17,397 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|))) is different from true [2021-11-25 18:44:17,466 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:44:17,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 18:44:17,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 18:44:17,568 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:44:17,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-11-25 18:44:17,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-11-25 18:44:17,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 18:44:17,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-11-25 18:44:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 665 not checked. [2021-11-25 18:44:17,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:44:17,674 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5328) |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_5329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-11-25 18:44:17,703 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 18:44:18,349 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5421) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5420) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5420)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5421) .cse2 v_ArrVal_5328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_5329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-11-25 18:44:18,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470252757] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:18,359 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:44:18,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 37, 28] total 80 [2021-11-25 18:44:18,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232912030] [2021-11-25 18:44:18,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:44:18,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2021-11-25 18:44:18,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 18:44:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-11-25 18:44:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=177, Unknown=88, NotChecked=7920, Total=8372 [2021-11-25 18:44:18,363 INFO L87 Difference]: Start difference. First operand 657 states and 732 transitions. Second operand has 81 states, 79 states have (on average 2.1772151898734178) internal successors, (172), 81 states have internal predecessors, (172), 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) [2021-11-25 18:44:18,838 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5241) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5240))) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4695 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4695))) (exists ((v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4694) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:18,856 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4699 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4699) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4698 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4698) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2021-11-25 18:44:18,869 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4701) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4700))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766))) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298))) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214))) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2021-11-25 18:44:18,883 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738))) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2021-11-25 18:44:18,899 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738))) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2021-11-25 18:44:18,915 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738))) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2021-11-25 18:44:18,931 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5316))) (exists ((v_ArrVal_4767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4767) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5253) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4738 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4738))) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4707 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4707) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4739) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4777) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4746) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4744))) (exists ((v_ArrVal_5308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5308) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4756 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4756) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5314) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5252))) (exists ((v_ArrVal_5269 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5269) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4706) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5271 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5271))) (exists ((v_ArrVal_4747 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4747))) (exists ((v_ArrVal_4751 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4751))) (exists ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4704) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5266) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4725 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4725) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_5284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5284) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4196 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4196))) (exists ((v_ArrVal_4228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4228) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5277))) (exists ((v_ArrVal_4736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4736) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5285) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4752 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4752) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4769 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4769))) (exists ((v_ArrVal_4216 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4216) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4202 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4202) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5246) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4757) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4776) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4195) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170))) (exists ((v_ArrVal_5265 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5265) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4217) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4708) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4719 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4719) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5255 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5255))) (exists ((v_ArrVal_4737 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4737) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4150) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4780 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4780))) (exists ((v_ArrVal_4740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4740))) (exists ((v_ArrVal_5247 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5247) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4724) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4212) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_4766 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4766))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5315 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5315))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4749))) (exists ((v_ArrVal_5298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5298))) (exists ((v_ArrVal_5254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5254) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4741) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4715) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4753 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4753))) (exists ((v_ArrVal_4197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4197) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5276) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4233) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4748) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4711) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4205) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_5306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5306))) (exists ((v_ArrVal_5264 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5264))) (exists ((v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4709) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4215 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4215) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4218) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4762 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4762) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4232))) (exists ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5267) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4214 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4214))) (exists ((v_ArrVal_5268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5268) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4714 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4714))) (exists ((v_ArrVal_5324 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5324) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5270) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4203 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4203))) (exists ((v_ArrVal_4763 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4763))) (exists ((v_ArrVal_4775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4204 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4204) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4194))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4758) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4710) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5309) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5256))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5299) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4705 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4705))) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4219) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4750) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5257))) (exists ((v_ArrVal_5317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5251) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4229) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4781 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4781) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5250 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5250))) (exists ((v_ArrVal_4712 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4712))) (exists ((v_ArrVal_4213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4213)))) is different from true [2021-11-25 18:44:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:44:22,144 INFO L93 Difference]: Finished difference Result 663 states and 739 transitions. [2021-11-25 18:44:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 18:44:22,146 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 79 states have (on average 2.1772151898734178) internal successors, (172), 81 states have internal predecessors, (172), 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 [2021-11-25 18:44:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:44:22,150 INFO L225 Difference]: With dead ends: 663 [2021-11-25 18:44:22,150 INFO L226 Difference]: Without dead ends: 663 [2021-11-25 18:44:22,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 200 SyntacticMatches, 69 SemanticMatches, 104 ConstructedPredicates, 87 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=246, Invalid=342, Unknown=102, NotChecked=10440, Total=11130 [2021-11-25 18:44:22,153 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 406 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 38374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36767 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:44:22,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 1306 Invalid, 38374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1596 Invalid, 0 Unknown, 36767 Unchecked, 3.4s Time] [2021-11-25 18:44:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-11-25 18:44:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 656. [2021-11-25 18:44:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 465 states have (on average 1.5139784946236559) internal successors, (704), 649 states have internal predecessors, (704), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2021-11-25 18:44:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 731 transitions. [2021-11-25 18:44:22,169 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 731 transitions. Word has length 113 [2021-11-25 18:44:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:44:22,170 INFO L470 AbstractCegarLoop]: Abstraction has 656 states and 731 transitions. [2021-11-25 18:44:22,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 79 states have (on average 2.1772151898734178) internal successors, (172), 81 states have internal predecessors, (172), 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) [2021-11-25 18:44:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 731 transitions. [2021-11-25 18:44:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-25 18:44:22,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:44:22,172 INFO L514 BasicCegarLoop]: 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] [2021-11-25 18:44:22,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-11-25 18:44:22,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2021-11-25 18:44:22,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-11-25 18:44:22,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:44:22,794 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 326 more)] === [2021-11-25 18:44:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:44:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash 700677701, now seen corresponding path program 1 times [2021-11-25 18:44:22,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 18:44:22,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654788633] [2021-11-25 18:44:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:22,796 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 18:44:22,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 18:44:22,797 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 18:44:22,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-11-25 18:44:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:23,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-25 18:44:23,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:23,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:44:24,098 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-25 18:44:24,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-25 18:44:24,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:44:24,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-11-25 18:44:27,297 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:44:27,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-11-25 18:44:27,410 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:44:27,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-11-25 18:44:27,504 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:44:27,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-11-25 18:44:27,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-11-25 18:44:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2021-11-25 18:44:27,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:44:27,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (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_5844) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))))) is different from false [2021-11-25 18:44:27,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (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_5843))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5844)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2021-11-25 18:44:27,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (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_5843))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5844)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (_ bv1 1)))) is different from false [2021-11-25 18:44:28,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5890 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (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_5890))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5843)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5844)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2021-11-25 18:44:28,059 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 18:44:28,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654788633] [2021-11-25 18:44:28,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654788633] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:44:28,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1435475172] [2021-11-25 18:44:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:44:28,059 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 18:44:28,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 18:44:28,060 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 18:44:28,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5021eaf-1d2a-443e-a06f-aecf7f912734/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-11-25 18:44:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:44:53,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-25 18:44:53,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:44:53,476 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-25 18:44:53,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-11-25 18:44:54,238 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-11-25 18:44:54,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 50 [2021-11-25 18:44:54,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:44:54,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:44:54,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2021-11-25 18:44:54,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-11-25 18:44:55,419 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))))) (exists ((v_ArrVal_6273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6273) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:55,486 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))))) (exists ((v_ArrVal_6274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6274) |c_#memory_$Pointer$.offset|))) is different from true [2021-11-25 18:44:55,549 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))))) (exists ((v_ArrVal_6275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6275)))) is different from true [2021-11-25 18:44:56,104 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|))))) (exists ((v_ArrVal_6280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6280)))) is different from true [2021-11-25 18:44:56,600 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_ArrVal_6284 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6284))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 18:44:56,831 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6286) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 18:44:59,551 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_62 (_ BitVec 1)) (v_arrayElimCell_64 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_64)) (.cse0 (bvneg v_arrayElimCell_62))) (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse1 (select |c_#valid| (_ bv1 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse1)))) (bvneg (bvneg (bvneg (bvneg (bvneg .cse0)))))))))) (exists ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6309))) (exists ((v_arrayElimCell_63 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (let ((.cse2 (bvneg (bvneg v_arrayElimCell_63)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7|)))))) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| (_ bv1 32))) (= (_ bv0 1) (bvadd (bvneg .cse2) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse2 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))) (not (= |v_ULTIMATE.start_main_#t~mem33#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_7|)))))) is different from true [2021-11-25 18:45:00,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 18:45:00,562 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:45:00,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 49 [2021-11-25 18:45:00,582 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-11-25 18:45:00,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2021-11-25 18:45:00,588 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:45:00,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-25 18:45:00,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:00,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:00,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:00,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:45:00,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2021-11-25 18:45:01,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-25 18:45:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 287 not checked. [2021-11-25 18:45:01,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:45:02,136 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 18:45:02,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1704 treesize of output 1538 [2021-11-25 18:45:02,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 383012 treesize of output 316232 [2021-11-25 18:45:02,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 327647 treesize of output 327543 [2021-11-25 18:45:28,432 WARN L227 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 455 DAG size of output: 455 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-25 18:45:35,793 WARN L227 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 455 DAG size of output: 455 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)