./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:47:25,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:25,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:25,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:25,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:25,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:25,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:25,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:25,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:25,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:25,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:25,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:25,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:25,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:25,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:25,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:25,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:25,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:25,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:25,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:25,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:25,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:25,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:25,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:25,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:25,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:25,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:25,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:25,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:25,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:25,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:25,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:25,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:25,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:25,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:25,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:25,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:25,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:25,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:25,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:25,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:25,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:47:25,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:25,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:25,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:25,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:25,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:25,655 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:25,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:25,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:25,656 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:25,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:25,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:47:25,658 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:47:25,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:25,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:47:25,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:25,659 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:47:25,660 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:47:25,660 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:47:25,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:25,660 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:47:25,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:47:25,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:25,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:25,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:25,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:25,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:25,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:25,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:25,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:47:25,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:47:25,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/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_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 [2022-11-02 20:47:26,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:26,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:26,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:26,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:26,075 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:26,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2022-11-02 20:47:26,151 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data/7809162d7/2dced8cbd0e2410398666d3d71752fd4/FLAGd58e99106 [2022-11-02 20:47:26,744 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:26,744 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2022-11-02 20:47:26,773 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data/7809162d7/2dced8cbd0e2410398666d3d71752fd4/FLAGd58e99106 [2022-11-02 20:47:27,001 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data/7809162d7/2dced8cbd0e2410398666d3d71752fd4 [2022-11-02 20:47:27,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:27,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:27,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:27,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:27,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:27,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:27" (1/1) ... [2022-11-02 20:47:27,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0394ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:27, skipping insertion in model container [2022-11-02 20:47:27,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:27" (1/1) ... [2022-11-02 20:47:27,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:27,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:27,457 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_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i[33021,33034] [2022-11-02 20:47:27,558 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_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i[44590,44603] [2022-11-02 20:47:27,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:27,596 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-02 20:47:27,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@69271c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:27, skipping insertion in model container [2022-11-02 20:47:27,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:27,609 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-02 20:47:27,611 INFO L158 Benchmark]: Toolchain (without parser) took 605.06ms. Allocated memory is still 130.0MB. Free memory was 89.1MB in the beginning and 94.0MB in the end (delta: -4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:47:27,612 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory was 107.8MB in the beginning and 107.7MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:47:27,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.45ms. Allocated memory is still 130.0MB. Free memory was 89.0MB in the beginning and 94.0MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:47:27,617 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.27ms. Allocated memory is still 130.0MB. Free memory was 107.8MB in the beginning and 107.7MB in the end (delta: 97.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.45ms. Allocated memory is still 130.0MB. Free memory was 89.0MB in the beginning and 94.0MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:47:29,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:29,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:29,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:29,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:29,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:29,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:29,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:29,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:29,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:29,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:29,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:29,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:29,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:29,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:29,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:29,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:29,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:29,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:29,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:29,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:29,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:29,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:29,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:29,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:29,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:29,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:29,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:29,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:29,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:29,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:29,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:29,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:29,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:29,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:29,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:29,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:29,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:29,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:29,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:29,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:29,997 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-02 20:47:30,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:30,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:30,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:30,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:30,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:30,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:30,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:30,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:30,045 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:30,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:30,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:47:30,046 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:47:30,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:30,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:47:30,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:30,047 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:47:30,048 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:47:30,048 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:47:30,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:30,048 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:47:30,049 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:47:30,049 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:47:30,049 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:47:30,049 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:30,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:30,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:30,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:30,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:30,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:30,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:30,051 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:47:30,051 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:47:30,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:47:30,052 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_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/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_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6560568361eacef24363f4e5a58f5226b4c8bc2851167e042d4f8ce61eb0aa48 [2022-11-02 20:47:30,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:30,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:30,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:30,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:30,569 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:30,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2022-11-02 20:47:30,650 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data/8027b836c/b67da710ce0343ecabbdb54f73c59383/FLAG9af04b3ca [2022-11-02 20:47:31,351 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:31,352 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i [2022-11-02 20:47:31,367 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data/8027b836c/b67da710ce0343ecabbdb54f73c59383/FLAG9af04b3ca [2022-11-02 20:47:31,580 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/data/8027b836c/b67da710ce0343ecabbdb54f73c59383 [2022-11-02 20:47:31,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:31,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:31,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:31,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:31,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:31,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:31" (1/1) ... [2022-11-02 20:47:31,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de2ed61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:31, skipping insertion in model container [2022-11-02 20:47:31,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:31" (1/1) ... [2022-11-02 20:47:31,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:31,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:32,268 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_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i[33021,33034] [2022-11-02 20:47:32,474 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_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i[44590,44603] [2022-11-02 20:47:32,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:32,524 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-02 20:47:32,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:32,556 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_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i[33021,33034] [2022-11-02 20:47:32,623 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_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i[44590,44603] [2022-11-02 20:47:32,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:32,636 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:47:32,662 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_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i[33021,33034] [2022-11-02 20:47:32,701 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_15f86fc2-44b1-4b9d-b064-51c16699b678/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-2.i[44590,44603] [2022-11-02 20:47:32,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:32,764 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:47:32,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32 WrapperNode [2022-11-02 20:47:32,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:32,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:32,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:47:32,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:47:32,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:32,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:32,877 INFO L138 Inliner]: procedures = 180, calls = 336, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1205 [2022-11-02 20:47:32,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:32,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:47:32,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:47:32,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:47:32,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:32,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:32,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:32,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:33,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:33,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:33,040 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:33,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:33,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:47:33,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:47:33,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:47:33,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:47:33,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (1/1) ... [2022-11-02 20:47:33,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:33,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:33,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:47:33,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:47:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-02 20:47:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 20:47:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:47:33,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:47:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:47:33,192 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:47:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:47:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:47:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:47:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:47:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 20:47:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:47:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:47:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 20:47:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:47:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:47:33,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:47:33,509 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:47:33,511 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:47:33,514 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:47:39,870 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:47:39,886 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:47:39,886 INFO L300 CfgBuilder]: Removed 72 assume(true) statements. [2022-11-02 20:47:39,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:39 BoogieIcfgContainer [2022-11-02 20:47:39,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:47:39,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:47:39,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:47:39,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:47:39,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:31" (1/3) ... [2022-11-02 20:47:39,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31297ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:39, skipping insertion in model container [2022-11-02 20:47:39,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:32" (2/3) ... [2022-11-02 20:47:39,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31297ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:39, skipping insertion in model container [2022-11-02 20:47:39,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:39" (3/3) ... [2022-11-02 20:47:39,900 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test3-2.i [2022-11-02 20:47:39,920 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:47:39,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 639 error locations. [2022-11-02 20:47:39,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:47:40,009 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20756cfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:47:40,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 639 error locations. [2022-11-02 20:47:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 1271 states, 624 states have (on average 2.2580128205128207) internal successors, (1409), 1265 states have internal predecessors, (1409), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:47:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:40,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:40,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:40,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:47:40,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-11-02 20:47:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:47:40,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804700563] [2022-11-02 20:47:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:47:40,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:47:40,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:47:40,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:47:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:40,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:47:40,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:40,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:47:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:40,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:40,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:47:40,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804700563] [2022-11-02 20:47:40,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804700563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:40,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:40,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:40,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599695854] [2022-11-02 20:47:40,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:40,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:40,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:47:40,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:40,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:40,454 INFO L87 Difference]: Start difference. First operand has 1271 states, 624 states have (on average 2.2580128205128207) internal successors, (1409), 1265 states have internal predecessors, (1409), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:43,348 INFO L93 Difference]: Finished difference Result 1443 states and 1528 transitions. [2022-11-02 20:47:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:43,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:43,372 INFO L225 Difference]: With dead ends: 1443 [2022-11-02 20:47:43,372 INFO L226 Difference]: Without dead ends: 1441 [2022-11-02 20:47:43,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:43,377 INFO L413 NwaCegarLoop]: 769 mSDtfsCounter, 1181 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:43,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 928 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 20:47:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-11-02 20:47:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1256. [2022-11-02 20:47:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 624 states have (on average 2.110576923076923) internal successors, (1317), 1250 states have internal predecessors, (1317), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:47:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1333 transitions. [2022-11-02 20:47:43,487 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1333 transitions. Word has length 3 [2022-11-02 20:47:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:43,487 INFO L495 AbstractCegarLoop]: Abstraction has 1256 states and 1333 transitions. [2022-11-02 20:47:43,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1333 transitions. [2022-11-02 20:47:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:43,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:43,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:43,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:43,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:47:43,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:47:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:43,703 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-11-02 20:47:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:47:43,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009006742] [2022-11-02 20:47:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:43,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:47:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:47:43,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:47:43,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:47:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:43,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:47:43,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:43,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:43,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:43,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:47:43,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009006742] [2022-11-02 20:47:43,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009006742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:43,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:43,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:43,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067086069] [2022-11-02 20:47:43,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:43,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:47:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:43,897 INFO L87 Difference]: Start difference. First operand 1256 states and 1333 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:48,198 INFO L93 Difference]: Finished difference Result 1865 states and 1993 transitions. [2022-11-02 20:47:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:47:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:48,205 INFO L225 Difference]: With dead ends: 1865 [2022-11-02 20:47:48,205 INFO L226 Difference]: Without dead ends: 1865 [2022-11-02 20:47:48,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:48,207 INFO L413 NwaCegarLoop]: 1047 mSDtfsCounter, 650 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:48,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1750 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-02 20:47:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2022-11-02 20:47:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1456. [2022-11-02 20:47:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 825 states have (on average 2.0957575757575757) internal successors, (1729), 1450 states have internal predecessors, (1729), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:47:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1745 transitions. [2022-11-02 20:47:48,246 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1745 transitions. Word has length 3 [2022-11-02 20:47:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:48,246 INFO L495 AbstractCegarLoop]: Abstraction has 1456 states and 1745 transitions. [2022-11-02 20:47:48,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1745 transitions. [2022-11-02 20:47:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:47:48,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:48,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:48,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-02 20:47:48,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:47:48,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:47:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-11-02 20:47:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:47:48,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958901007] [2022-11-02 20:47:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:47:48,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:47:48,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:47:48,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:47:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:47:48,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:48,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:48,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:47:48,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:48,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:47:48,778 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:47:48,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:47:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:48,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:48,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:47:48,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958901007] [2022-11-02 20:47:48,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958901007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:48,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:48,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141045978] [2022-11-02 20:47:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:48,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:47:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:47:48,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:47:48,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:47:48,817 INFO L87 Difference]: Start difference. First operand 1456 states and 1745 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:53,115 INFO L93 Difference]: Finished difference Result 1634 states and 1934 transitions. [2022-11-02 20:47:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:47:53,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 20:47:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:53,122 INFO L225 Difference]: With dead ends: 1634 [2022-11-02 20:47:53,122 INFO L226 Difference]: Without dead ends: 1634 [2022-11-02 20:47:53,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:47:53,123 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 2629 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2637 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:53,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2637 Valid, 535 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-02 20:47:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2022-11-02 20:47:53,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1245. [2022-11-02 20:47:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 624 states have (on average 2.0913461538461537) internal successors, (1305), 1239 states have internal predecessors, (1305), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:47:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1321 transitions. [2022-11-02 20:47:53,153 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1321 transitions. Word has length 7 [2022-11-02 20:47:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:53,154 INFO L495 AbstractCegarLoop]: Abstraction has 1245 states and 1321 transitions. [2022-11-02 20:47:53,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1321 transitions. [2022-11-02 20:47:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:47:53,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:53,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:53,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:53,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:47:53,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:47:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-11-02 20:47:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:47:53,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477054526] [2022-11-02 20:47:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:47:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:47:53,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:47:53,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 20:47:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:53,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:47:53,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:53,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:47:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:53,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:53,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:47:53,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477054526] [2022-11-02 20:47:53,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477054526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:53,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:53,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950268194] [2022-11-02 20:47:53,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:53,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:47:53,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:53,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:53,572 INFO L87 Difference]: Start difference. First operand 1245 states and 1321 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:56,211 INFO L93 Difference]: Finished difference Result 1572 states and 1677 transitions. [2022-11-02 20:47:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:47:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:56,220 INFO L225 Difference]: With dead ends: 1572 [2022-11-02 20:47:56,220 INFO L226 Difference]: Without dead ends: 1572 [2022-11-02 20:47:56,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:56,221 INFO L413 NwaCegarLoop]: 1163 mSDtfsCounter, 990 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:56,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1509 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 20:47:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2022-11-02 20:47:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1196. [2022-11-02 20:47:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 624 states have (on average 2.0128205128205128) internal successors, (1256), 1190 states have internal predecessors, (1256), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:47:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1272 transitions. [2022-11-02 20:47:56,250 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1272 transitions. Word has length 8 [2022-11-02 20:47:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:56,250 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1272 transitions. [2022-11-02 20:47:56,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1272 transitions. [2022-11-02 20:47:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:47:56,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:56,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:56,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:56,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:47:56,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:47:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-11-02 20:47:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:47:56,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629954113] [2022-11-02 20:47:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:56,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:47:56,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:47:56,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:47:56,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 20:47:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:56,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:47:56,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:56,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:56,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:56,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:47:56,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629954113] [2022-11-02 20:47:56,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629954113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:56,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:56,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440329714] [2022-11-02 20:47:56,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:56,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:56,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:47:56,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:56,678 INFO L87 Difference]: Start difference. First operand 1196 states and 1272 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:00,368 INFO L93 Difference]: Finished difference Result 1650 states and 1758 transitions. [2022-11-02 20:48:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:48:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:00,373 INFO L225 Difference]: With dead ends: 1650 [2022-11-02 20:48:00,373 INFO L226 Difference]: Without dead ends: 1650 [2022-11-02 20:48:00,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:00,375 INFO L413 NwaCegarLoop]: 1372 mSDtfsCounter, 673 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:00,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1914 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 20:48:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-11-02 20:48:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1218. [2022-11-02 20:48:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 656 states have (on average 2.0) internal successors, (1312), 1212 states have internal predecessors, (1312), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1328 transitions. [2022-11-02 20:48:00,404 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1328 transitions. Word has length 8 [2022-11-02 20:48:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:00,404 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1328 transitions. [2022-11-02 20:48:00,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1328 transitions. [2022-11-02 20:48:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:48:00,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:00,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:00,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:00,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:00,617 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash 871377621, now seen corresponding path program 1 times [2022-11-02 20:48:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:00,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813577332] [2022-11-02 20:48:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:00,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:00,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:00,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:00,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-02 20:48:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:00,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:48:00,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:00,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:00,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:00,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813577332] [2022-11-02 20:48:00,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813577332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:00,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:00,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483703531] [2022-11-02 20:48:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:00,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:00,907 INFO L87 Difference]: Start difference. First operand 1218 states and 1328 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:01,992 INFO L93 Difference]: Finished difference Result 1864 states and 2017 transitions. [2022-11-02 20:48:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 20:48:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:01,999 INFO L225 Difference]: With dead ends: 1864 [2022-11-02 20:48:01,999 INFO L226 Difference]: Without dead ends: 1864 [2022-11-02 20:48:02,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:02,000 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 753 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 3739 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:02,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 3739 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:48:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-11-02 20:48:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1462. [2022-11-02 20:48:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 900 states have (on average 1.9677777777777778) internal successors, (1771), 1456 states have internal predecessors, (1771), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1787 transitions. [2022-11-02 20:48:02,034 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1787 transitions. Word has length 11 [2022-11-02 20:48:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:02,035 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 1787 transitions. [2022-11-02 20:48:02,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1787 transitions. [2022-11-02 20:48:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:48:02,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:02,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:02,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-02 20:48:02,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:02,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash -702153283, now seen corresponding path program 1 times [2022-11-02 20:48:02,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:02,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384343187] [2022-11-02 20:48:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:02,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:02,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:02,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:02,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-02 20:48:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:48:02,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:02,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:02,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384343187] [2022-11-02 20:48:02,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384343187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:02,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:02,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:48:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675808383] [2022-11-02 20:48:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:02,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:02,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:02,445 INFO L87 Difference]: Start difference. First operand 1462 states and 1787 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:02,482 INFO L93 Difference]: Finished difference Result 1643 states and 1965 transitions. [2022-11-02 20:48:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:02,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:48:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:02,489 INFO L225 Difference]: With dead ends: 1643 [2022-11-02 20:48:02,489 INFO L226 Difference]: Without dead ends: 1643 [2022-11-02 20:48:02,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:02,490 INFO L413 NwaCegarLoop]: 1221 mSDtfsCounter, 602 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:02,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2072 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:48:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2022-11-02 20:48:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1402. [2022-11-02 20:48:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 864 states have (on average 1.9502314814814814) internal successors, (1685), 1396 states have internal predecessors, (1685), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1701 transitions. [2022-11-02 20:48:02,519 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1701 transitions. Word has length 13 [2022-11-02 20:48:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:02,520 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1701 transitions. [2022-11-02 20:48:02,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1701 transitions. [2022-11-02 20:48:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:48:02,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:02,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:02,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:02,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:02,734 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:02,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash -459414345, now seen corresponding path program 1 times [2022-11-02 20:48:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:02,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360173237] [2022-11-02 20:48:02,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:02,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:02,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:02,737 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:02,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-02 20:48:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:48:02,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:02,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:02,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:02,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360173237] [2022-11-02 20:48:02,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360173237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:02,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:02,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880170193] [2022-11-02 20:48:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:02,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:02,939 INFO L87 Difference]: Start difference. First operand 1402 states and 1701 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:03,037 INFO L93 Difference]: Finished difference Result 1615 states and 1909 transitions. [2022-11-02 20:48:03,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:03,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-11-02 20:48:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:03,044 INFO L225 Difference]: With dead ends: 1615 [2022-11-02 20:48:03,044 INFO L226 Difference]: Without dead ends: 1615 [2022-11-02 20:48:03,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:03,045 INFO L413 NwaCegarLoop]: 1176 mSDtfsCounter, 573 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 3196 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:03,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 3196 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2022-11-02 20:48:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1372. [2022-11-02 20:48:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 848 states have (on average 1.9186320754716981) internal successors, (1627), 1366 states have internal predecessors, (1627), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1643 transitions. [2022-11-02 20:48:03,075 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1643 transitions. Word has length 15 [2022-11-02 20:48:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:03,075 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1643 transitions. [2022-11-02 20:48:03,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1643 transitions. [2022-11-02 20:48:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:03,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:03,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:03,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:03,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:03,291 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr637ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash 552252916, now seen corresponding path program 1 times [2022-11-02 20:48:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:03,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998076845] [2022-11-02 20:48:03,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:03,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:03,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:03,293 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:03,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-02 20:48:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:03,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:48:03,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:03,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:03,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:03,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:03,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-11-02 20:48:03,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:03,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-02 20:48:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:03,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:03,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:03,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998076845] [2022-11-02 20:48:03,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998076845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:03,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:03,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187820217] [2022-11-02 20:48:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:03,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:03,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:03,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:03,617 INFO L87 Difference]: Start difference. First operand 1372 states and 1643 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:05,283 INFO L93 Difference]: Finished difference Result 1826 states and 2167 transitions. [2022-11-02 20:48:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-11-02 20:48:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:05,289 INFO L225 Difference]: With dead ends: 1826 [2022-11-02 20:48:05,290 INFO L226 Difference]: Without dead ends: 1826 [2022-11-02 20:48:05,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:05,291 INFO L413 NwaCegarLoop]: 1143 mSDtfsCounter, 443 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:05,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 3307 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:48:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2022-11-02 20:48:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1371. [2022-11-02 20:48:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 847 states have (on average 1.9185360094451003) internal successors, (1625), 1365 states have internal predecessors, (1625), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1641 transitions. [2022-11-02 20:48:05,319 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1641 transitions. Word has length 16 [2022-11-02 20:48:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:05,319 INFO L495 AbstractCegarLoop]: Abstraction has 1371 states and 1641 transitions. [2022-11-02 20:48:05,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1641 transitions. [2022-11-02 20:48:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:48:05,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:05,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:05,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-02 20:48:05,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:05,533 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-11-02 20:48:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:05,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117358030] [2022-11-02 20:48:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:05,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:05,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:05,535 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:05,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-02 20:48:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:05,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:48:05,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:05,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:05,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:05,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117358030] [2022-11-02 20:48:05,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117358030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:05,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:05,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:48:05,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238408568] [2022-11-02 20:48:05,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:05,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:05,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:05,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:05,732 INFO L87 Difference]: Start difference. First operand 1371 states and 1641 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:05,762 INFO L93 Difference]: Finished difference Result 1311 states and 1555 transitions. [2022-11-02 20:48:05,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:05,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-11-02 20:48:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:05,767 INFO L225 Difference]: With dead ends: 1311 [2022-11-02 20:48:05,767 INFO L226 Difference]: Without dead ends: 1311 [2022-11-02 20:48:05,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:05,768 INFO L413 NwaCegarLoop]: 1137 mSDtfsCounter, 1106 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:05,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1169 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:48:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2022-11-02 20:48:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2022-11-02 20:48:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 811 states have (on average 1.8976572133168927) internal successors, (1539), 1305 states have internal predecessors, (1539), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1555 transitions. [2022-11-02 20:48:05,801 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1555 transitions. Word has length 18 [2022-11-02 20:48:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:05,802 INFO L495 AbstractCegarLoop]: Abstraction has 1311 states and 1555 transitions. [2022-11-02 20:48:05,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1555 transitions. [2022-11-02 20:48:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:48:05,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:05,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:05,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:06,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:06,016 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-11-02 20:48:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:06,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795962028] [2022-11-02 20:48:06,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:06,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:06,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:06,018 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:06,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-02 20:48:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:48:06,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:06,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:06,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:06,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795962028] [2022-11-02 20:48:06,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795962028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:06,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:06,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:06,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089409924] [2022-11-02 20:48:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:06,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:06,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:06,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:06,250 INFO L87 Difference]: Start difference. First operand 1311 states and 1555 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:06,337 INFO L93 Difference]: Finished difference Result 1283 states and 1499 transitions. [2022-11-02 20:48:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:48:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:06,342 INFO L225 Difference]: With dead ends: 1283 [2022-11-02 20:48:06,343 INFO L226 Difference]: Without dead ends: 1283 [2022-11-02 20:48:06,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:06,344 INFO L413 NwaCegarLoop]: 1092 mSDtfsCounter, 1077 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:06,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 2209 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-11-02 20:48:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1281. [2022-11-02 20:48:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 795 states have (on average 1.8628930817610063) internal successors, (1481), 1275 states have internal predecessors, (1481), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1497 transitions. [2022-11-02 20:48:06,365 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1497 transitions. Word has length 20 [2022-11-02 20:48:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:06,366 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1497 transitions. [2022-11-02 20:48:06,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1497 transitions. [2022-11-02 20:48:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:48:06,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:06,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:06,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:06,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:06,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-11-02 20:48:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:06,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589352047] [2022-11-02 20:48:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:06,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:06,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:06,583 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:06,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-02 20:48:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:48:06,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:06,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:48:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:06,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:06,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:06,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589352047] [2022-11-02 20:48:06,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589352047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:06,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:06,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:48:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401729788] [2022-11-02 20:48:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:06,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:06,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:06,919 INFO L87 Difference]: Start difference. First operand 1281 states and 1497 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:10,074 INFO L93 Difference]: Finished difference Result 1880 states and 2230 transitions. [2022-11-02 20:48:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:10,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-11-02 20:48:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:10,079 INFO L225 Difference]: With dead ends: 1880 [2022-11-02 20:48:10,079 INFO L226 Difference]: Without dead ends: 1880 [2022-11-02 20:48:10,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:10,080 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 1768 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1773 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:10,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1773 Valid, 1271 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-02 20:48:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-11-02 20:48:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1277. [2022-11-02 20:48:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 795 states have (on average 1.8528301886792453) internal successors, (1473), 1271 states have internal predecessors, (1473), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1489 transitions. [2022-11-02 20:48:10,102 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1489 transitions. Word has length 34 [2022-11-02 20:48:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:10,103 INFO L495 AbstractCegarLoop]: Abstraction has 1277 states and 1489 transitions. [2022-11-02 20:48:10,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1489 transitions. [2022-11-02 20:48:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:48:10,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:10,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:10,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:10,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:10,317 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-11-02 20:48:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:10,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841853121] [2022-11-02 20:48:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:10,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:10,320 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:10,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-02 20:48:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:10,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:48:10,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:10,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:48:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:10,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:10,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:10,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841853121] [2022-11-02 20:48:10,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841853121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:10,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:10,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:48:10,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522969403] [2022-11-02 20:48:10,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:10,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:10,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:10,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:10,773 INFO L87 Difference]: Start difference. First operand 1277 states and 1489 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:15,490 INFO L93 Difference]: Finished difference Result 2008 states and 2337 transitions. [2022-11-02 20:48:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:15,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-11-02 20:48:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:15,496 INFO L225 Difference]: With dead ends: 2008 [2022-11-02 20:48:15,496 INFO L226 Difference]: Without dead ends: 2008 [2022-11-02 20:48:15,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:15,497 INFO L413 NwaCegarLoop]: 1438 mSDtfsCounter, 1230 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:15,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 2582 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-02 20:48:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2022-11-02 20:48:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1273. [2022-11-02 20:48:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 795 states have (on average 1.8427672955974843) internal successors, (1465), 1267 states have internal predecessors, (1465), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1481 transitions. [2022-11-02 20:48:15,520 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1481 transitions. Word has length 34 [2022-11-02 20:48:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:15,520 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1481 transitions. [2022-11-02 20:48:15,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1481 transitions. [2022-11-02 20:48:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:48:15,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:15,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:15,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:15,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:15,735 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-11-02 20:48:15,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:15,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455668811] [2022-11-02 20:48:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:15,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:15,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:15,739 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:15,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-02 20:48:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:16,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:48:16,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:16,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:16,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:16,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455668811] [2022-11-02 20:48:16,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455668811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:16,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:16,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235149702] [2022-11-02 20:48:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:16,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:16,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:16,101 INFO L87 Difference]: Start difference. First operand 1273 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:16,176 INFO L93 Difference]: Finished difference Result 1261 states and 1461 transitions. [2022-11-02 20:48:16,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-11-02 20:48:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:16,183 INFO L225 Difference]: With dead ends: 1261 [2022-11-02 20:48:16,184 INFO L226 Difference]: Without dead ends: 1261 [2022-11-02 20:48:16,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:16,185 INFO L413 NwaCegarLoop]: 1086 mSDtfsCounter, 1053 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:16,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 2187 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:48:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-11-02 20:48:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261. [2022-11-02 20:48:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 783 states have (on average 1.8454661558109835) internal successors, (1445), 1255 states have internal predecessors, (1445), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1461 transitions. [2022-11-02 20:48:16,208 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1461 transitions. Word has length 52 [2022-11-02 20:48:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:16,209 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1461 transitions. [2022-11-02 20:48:16,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1461 transitions. [2022-11-02 20:48:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:48:16,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:16,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:16,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:16,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:16,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-11-02 20:48:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:16,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211999646] [2022-11-02 20:48:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:16,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:16,430 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:16,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-02 20:48:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:16,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:48:16,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:16,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:48:16,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:48:17,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:17,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:48:17,589 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:48:17,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:48:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:17,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:17,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211999646] [2022-11-02 20:48:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211999646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:17,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:17,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:48:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941933818] [2022-11-02 20:48:17,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:17,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:17,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:17,615 INFO L87 Difference]: Start difference. First operand 1261 states and 1461 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:21,222 INFO L93 Difference]: Finished difference Result 1609 states and 1926 transitions. [2022-11-02 20:48:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-11-02 20:48:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:21,230 INFO L225 Difference]: With dead ends: 1609 [2022-11-02 20:48:21,231 INFO L226 Difference]: Without dead ends: 1609 [2022-11-02 20:48:21,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:21,232 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 1106 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:21,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 876 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 20:48:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2022-11-02 20:48:21,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1191. [2022-11-02 20:48:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 751 states have (on average 1.785619174434088) internal successors, (1341), 1185 states have internal predecessors, (1341), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1357 transitions. [2022-11-02 20:48:21,273 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1357 transitions. Word has length 60 [2022-11-02 20:48:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:21,274 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1357 transitions. [2022-11-02 20:48:21,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1357 transitions. [2022-11-02 20:48:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:48:21,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:21,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:21,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:21,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:21,495 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-11-02 20:48:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:21,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899651559] [2022-11-02 20:48:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:21,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:21,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:21,497 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:21,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-02 20:48:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:21,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:48:21,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:21,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:48:21,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:48:21,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-02 20:48:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:21,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:21,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:21,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899651559] [2022-11-02 20:48:21,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899651559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:21,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:21,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86928707] [2022-11-02 20:48:21,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:21,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:48:21,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:21,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:48:21,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:21,917 INFO L87 Difference]: Start difference. First operand 1191 states and 1357 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:25,198 INFO L93 Difference]: Finished difference Result 1190 states and 1356 transitions. [2022-11-02 20:48:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:48:25,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-11-02 20:48:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:25,203 INFO L225 Difference]: With dead ends: 1190 [2022-11-02 20:48:25,203 INFO L226 Difference]: Without dead ends: 1190 [2022-11-02 20:48:25,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:25,204 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 4 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:25,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2684 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-02 20:48:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-11-02 20:48:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2022-11-02 20:48:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 751 states have (on average 1.7842876165113182) internal successors, (1340), 1184 states have internal predecessors, (1340), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1356 transitions. [2022-11-02 20:48:25,221 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1356 transitions. Word has length 65 [2022-11-02 20:48:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:25,221 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 1356 transitions. [2022-11-02 20:48:25,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1356 transitions. [2022-11-02 20:48:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:48:25,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:25,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:25,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-02 20:48:25,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:25,438 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-11-02 20:48:25,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:25,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354953621] [2022-11-02 20:48:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:25,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:25,440 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:25,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-02 20:48:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:25,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:48:25,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:25,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:48:25,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:48:25,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:48:25,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-02 20:48:25,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:48:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:25,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:25,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:25,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354953621] [2022-11-02 20:48:25,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354953621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:25,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:25,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:25,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601549226] [2022-11-02 20:48:25,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:25,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:48:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:25,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:48:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:25,908 INFO L87 Difference]: Start difference. First operand 1190 states and 1356 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:30,210 INFO L93 Difference]: Finished difference Result 1189 states and 1355 transitions. [2022-11-02 20:48:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:48:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-11-02 20:48:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:30,216 INFO L225 Difference]: With dead ends: 1189 [2022-11-02 20:48:30,216 INFO L226 Difference]: Without dead ends: 1189 [2022-11-02 20:48:30,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:30,217 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 2 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:30,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2737 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-02 20:48:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-11-02 20:48:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1189. [2022-11-02 20:48:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 750 states have (on average 1.7853333333333334) internal successors, (1339), 1183 states have internal predecessors, (1339), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:48:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1355 transitions. [2022-11-02 20:48:30,237 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1355 transitions. Word has length 65 [2022-11-02 20:48:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:30,237 INFO L495 AbstractCegarLoop]: Abstraction has 1189 states and 1355 transitions. [2022-11-02 20:48:30,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1355 transitions. [2022-11-02 20:48:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 20:48:30,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:30,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:30,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-11-02 20:48:30,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:30,453 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash 231575279, now seen corresponding path program 1 times [2022-11-02 20:48:30,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:30,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584434455] [2022-11-02 20:48:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:30,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:30,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:30,456 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:30,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-02 20:48:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:30,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:48:30,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:30,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:30,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:30,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584434455] [2022-11-02 20:48:30,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584434455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:30,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:30,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008096176] [2022-11-02 20:48:30,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:30,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:30,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:30,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:30,862 INFO L87 Difference]: Start difference. First operand 1189 states and 1355 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:48:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:30,924 INFO L93 Difference]: Finished difference Result 1192 states and 1359 transitions. [2022-11-02 20:48:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:30,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 73 [2022-11-02 20:48:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:30,930 INFO L225 Difference]: With dead ends: 1192 [2022-11-02 20:48:30,930 INFO L226 Difference]: Without dead ends: 1192 [2022-11-02 20:48:30,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:30,931 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 2 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3133 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 [2022-11-02 20:48:30,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3133 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:48:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2022-11-02 20:48:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2022-11-02 20:48:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 752 states have (on average 1.7845744680851063) internal successors, (1342), 1186 states have internal predecessors, (1342), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:48:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1359 transitions. [2022-11-02 20:48:30,953 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1359 transitions. Word has length 73 [2022-11-02 20:48:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:30,953 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1359 transitions. [2022-11-02 20:48:30,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:48:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1359 transitions. [2022-11-02 20:48:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:48:30,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:30,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:30,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-02 20:48:31,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:31,170 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash -695791212, now seen corresponding path program 1 times [2022-11-02 20:48:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:31,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108102322] [2022-11-02 20:48:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:31,173 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:31,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-02 20:48:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:31,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:48:31,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:31,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:31,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108102322] [2022-11-02 20:48:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108102322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:31,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:48:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-02 20:48:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334032754] [2022-11-02 20:48:31,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:31,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:48:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:31,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:48:31,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:48:31,745 INFO L87 Difference]: Start difference. First operand 1192 states and 1359 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:48:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:31,997 INFO L93 Difference]: Finished difference Result 1204 states and 1376 transitions. [2022-11-02 20:48:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:48:31,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 74 [2022-11-02 20:48:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:32,014 INFO L225 Difference]: With dead ends: 1204 [2022-11-02 20:48:32,014 INFO L226 Difference]: Without dead ends: 1204 [2022-11-02 20:48:32,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:32,016 INFO L413 NwaCegarLoop]: 1047 mSDtfsCounter, 15 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4177 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:32,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4177 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-11-02 20:48:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1202. [2022-11-02 20:48:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 761 states have (on average 1.783180026281209) internal successors, (1357), 1195 states have internal predecessors, (1357), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:48:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1374 transitions. [2022-11-02 20:48:32,040 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1374 transitions. Word has length 74 [2022-11-02 20:48:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:32,041 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1374 transitions. [2022-11-02 20:48:32,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:48:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1374 transitions. [2022-11-02 20:48:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:48:32,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:32,048 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:32,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:32,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:32,265 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash 829132847, now seen corresponding path program 2 times [2022-11-02 20:48:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:32,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147631316] [2022-11-02 20:48:32,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:48:32,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:32,267 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:32,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-02 20:48:32,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:48:32,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:32,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:48:32,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:32,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:33,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:33,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147631316] [2022-11-02 20:48:33,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147631316] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:33,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:48:33,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-02 20:48:33,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879589623] [2022-11-02 20:48:33,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:33,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:48:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:48:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:48:33,106 INFO L87 Difference]: Start difference. First operand 1202 states and 1374 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:48:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:34,092 INFO L93 Difference]: Finished difference Result 1223 states and 1402 transitions. [2022-11-02 20:48:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:48:34,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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 77 [2022-11-02 20:48:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:34,098 INFO L225 Difference]: With dead ends: 1223 [2022-11-02 20:48:34,098 INFO L226 Difference]: Without dead ends: 1219 [2022-11-02 20:48:34,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:48:34,099 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 44 mSDsluCounter, 9396 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 10446 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:34,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 10446 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2022-11-02 20:48:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1211. [2022-11-02 20:48:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 770 states have (on average 1.777922077922078) internal successors, (1369), 1204 states have internal predecessors, (1369), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:48:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1386 transitions. [2022-11-02 20:48:34,145 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1386 transitions. Word has length 77 [2022-11-02 20:48:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:34,145 INFO L495 AbstractCegarLoop]: Abstraction has 1211 states and 1386 transitions. [2022-11-02 20:48:34,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:48:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1386 transitions. [2022-11-02 20:48:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 20:48:34,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:34,150 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:34,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:34,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:34,367 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1846060559, now seen corresponding path program 3 times [2022-11-02 20:48:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:34,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17267592] [2022-11-02 20:48:34,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:48:34,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:34,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:34,370 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:34,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-02 20:48:35,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-02 20:48:35,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:35,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:48:35,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:35,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:36,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:36,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17267592] [2022-11-02 20:48:36,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17267592] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:36,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:48:36,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-02 20:48:36,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042935536] [2022-11-02 20:48:36,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:36,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:48:36,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:36,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:48:36,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:36,444 INFO L87 Difference]: Start difference. First operand 1211 states and 1386 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:48:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:41,358 INFO L93 Difference]: Finished difference Result 1253 states and 1448 transitions. [2022-11-02 20:48:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-02 20:48:41,360 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 83 [2022-11-02 20:48:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:41,364 INFO L225 Difference]: With dead ends: 1253 [2022-11-02 20:48:41,364 INFO L226 Difference]: Without dead ends: 1247 [2022-11-02 20:48:41,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 20:48:41,366 INFO L413 NwaCegarLoop]: 1055 mSDtfsCounter, 188 mSDsluCounter, 13640 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 14695 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:41,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 14695 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:48:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-11-02 20:48:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1229. [2022-11-02 20:48:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 788 states have (on average 1.766497461928934) internal successors, (1392), 1222 states have internal predecessors, (1392), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:48:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1409 transitions. [2022-11-02 20:48:41,392 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1409 transitions. Word has length 83 [2022-11-02 20:48:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:41,393 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1409 transitions. [2022-11-02 20:48:41,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:48:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1409 transitions. [2022-11-02 20:48:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 20:48:41,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:41,395 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:41,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:41,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:48:41,610 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:48:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash -662627889, now seen corresponding path program 4 times [2022-11-02 20:48:41,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:48:41,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288524307] [2022-11-02 20:48:41,610 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:48:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:48:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:48:41,611 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:48:41,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-02 20:48:42,181 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:48:42,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:42,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:48:42,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:42,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:45,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:48:45,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288524307] [2022-11-02 20:48:45,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288524307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:45,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:48:45,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-02 20:48:45,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045570211] [2022-11-02 20:48:45,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:45,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:48:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:48:45,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:48:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-02 20:48:45,502 INFO L87 Difference]: Start difference. First operand 1229 states and 1409 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:49:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:03,257 INFO L93 Difference]: Finished difference Result 1309 states and 1521 transitions. [2022-11-02 20:49:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-02 20:49:03,260 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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 95 [2022-11-02 20:49:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:03,262 INFO L225 Difference]: With dead ends: 1309 [2022-11-02 20:49:03,262 INFO L226 Difference]: Without dead ends: 1305 [2022-11-02 20:49:03,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-02 20:49:03,267 INFO L413 NwaCegarLoop]: 1067 mSDtfsCounter, 438 mSDsluCounter, 24453 mSDsCounter, 0 mSdLazyCounter, 2427 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 25520 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:03,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 25520 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2427 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-02 20:49:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2022-11-02 20:49:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1263. [2022-11-02 20:49:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 822 states have (on average 1.7493917274939172) internal successors, (1438), 1256 states have internal predecessors, (1438), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:49:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1455 transitions. [2022-11-02 20:49:03,295 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1455 transitions. Word has length 95 [2022-11-02 20:49:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:03,295 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 1455 transitions. [2022-11-02 20:49:03,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:49:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1455 transitions. [2022-11-02 20:49:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:49:03,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:03,298 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:03,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:03,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:49:03,518 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:49:03,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:03,519 INFO L85 PathProgramCache]: Analyzing trace with hash -218678097, now seen corresponding path program 5 times [2022-11-02 20:49:03,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:49:03,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743915318] [2022-11-02 20:49:03,519 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:49:03,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:49:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:49:03,521 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:49:03,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-02 20:49:05,380 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-02 20:49:05,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:49:05,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-02 20:49:05,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:05,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:49:05,845 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:49:05,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:49:05,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:49:05,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:49:05,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:49:06,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-02 20:49:06,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:49:06,314 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:06,453 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:06,518 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:06,596 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:06,666 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:06,687 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:06,708 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:49:06,727 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:49:06,747 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970)))) is different from true [2022-11-02 20:49:06,772 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:49:06,850 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977)))) is different from true [2022-11-02 20:49:06,869 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978)))) is different from true [2022-11-02 20:49:06,887 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:06,907 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:49:06,928 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:06,992 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,011 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,078 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,140 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-02 20:49:07,173 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,190 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,207 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,295 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:49:07,313 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,468 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,486 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:49:07,503 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2024))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2025)))) is different from true [2022-11-02 20:49:07,667 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:49:07,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-02 20:49:07,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:49:07,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:49:07,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:49:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-11-02 20:49:07,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:09,133 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2121 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2120 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-02 20:49:09,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:49:09,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743915318] [2022-11-02 20:49:09,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743915318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:09,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [115290397] [2022-11-02 20:49:09,147 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:49:09,147 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:49:09,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:49:09,150 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:49:09,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-02 20:50:31,540 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-02 20:50:31,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:50:31,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-02 20:50:31,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:31,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:50:31,981 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:50:31,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:50:31,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:50:32,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:50:32,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:50:32,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:50:32,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-02 20:50:32,441 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:32,462 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:50:32,564 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-11-02 20:50:32,629 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:32,777 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:32,794 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:32,811 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:32,829 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-11-02 20:50:32,926 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:32,942 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-11-02 20:50:33,093 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:50:33,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,170 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,187 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,208 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,225 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,343 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,359 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,508 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,525 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,541 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,601 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577)))) is different from true [2022-11-02 20:50:33,617 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-02 20:50:33,766 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:50:33,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-02 20:50:33,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:50:33,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-02 20:50:33,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:50:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 759 not checked. [2022-11-02 20:50:33,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:34,904 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2675 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-02 20:50:34,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [115290397] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:34,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:50:34,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31] total 63 [2022-11-02 20:50:34,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308978064] [2022-11-02 20:50:34,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:34,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-02 20:50:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:50:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-02 20:50:34,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=214, Unknown=63, NotChecked=4134, Total=4556 [2022-11-02 20:50:34,917 INFO L87 Difference]: Start difference. First operand 1263 states and 1455 transitions. Second operand has 64 states, 61 states have (on average 3.3934426229508197) internal successors, (207), 64 states have internal predecessors, (207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:50:35,803 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577)))) is different from true [2022-11-02 20:50:35,821 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-02 20:50:35,843 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2024))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2025))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-02 20:50:35,865 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2024))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2025))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-02 20:50:35,888 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2024))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2025))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-02 20:50:35,913 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2021))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2024 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2024))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2020 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2020))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574))) (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2025 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2025))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-02 20:50:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:46,067 INFO L93 Difference]: Finished difference Result 1652 states and 1959 transitions. [2022-11-02 20:50:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:50:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 3.3934426229508197) internal successors, (207), 64 states have internal predecessors, (207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2022-11-02 20:50:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:46,072 INFO L225 Difference]: With dead ends: 1652 [2022-11-02 20:50:46,072 INFO L226 Difference]: Without dead ends: 1648 [2022-11-02 20:50:46,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 135 SyntacticMatches, 39 SemanticMatches, 77 ConstructedPredicates, 59 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=201, Invalid=341, Unknown=74, NotChecked=5546, Total=6162 [2022-11-02 20:50:46,074 INFO L413 NwaCegarLoop]: 679 mSDtfsCounter, 1374 mSDsluCounter, 3160 mSDsCounter, 0 mSdLazyCounter, 3961 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 75999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72018 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:46,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 3839 Invalid, 75999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 3961 Invalid, 0 Unknown, 72018 Unchecked, 10.5s Time] [2022-11-02 20:50:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-11-02 20:50:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1262. [2022-11-02 20:50:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 822 states have (on average 1.74330900243309) internal successors, (1433), 1255 states have internal predecessors, (1433), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:50:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1450 transitions. [2022-11-02 20:50:46,101 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1450 transitions. Word has length 117 [2022-11-02 20:50:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:46,102 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 1450 transitions. [2022-11-02 20:50:46,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 3.3934426229508197) internal successors, (207), 64 states have internal predecessors, (207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:50:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1450 transitions. [2022-11-02 20:50:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:50:46,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:46,104 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:46,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:46,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-02 20:50:46,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt [2022-11-02 20:50:46,531 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:50:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -218678098, now seen corresponding path program 1 times [2022-11-02 20:50:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:50:46,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245646893] [2022-11-02 20:50:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:50:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:50:46,535 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:50:46,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-02 20:50:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:47,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-02 20:50:47,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:47,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:50:47,720 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:50:47,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 20:50:47,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:50:47,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:50:48,083 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:48,438 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058)))) is different from true [2022-11-02 20:50:48,515 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:48,641 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:48,868 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:49,014 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:49,037 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:49,108 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:49,133 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075)))) is different from true [2022-11-02 20:50:49,286 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:49,459 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083)))) is different from true [2022-11-02 20:50:49,741 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:50,017 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:50:50,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:50:50,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:50:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 496 trivial. 462 not checked. [2022-11-02 20:50:50,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:50,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3139) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-11-02 20:50:50,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:50:50,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245646893] [2022-11-02 20:50:50,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245646893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:50,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1466818717] [2022-11-02 20:50:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:50,550 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:50:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:50:50,551 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:50:50,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-02 20:50:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:52,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-02 20:50:52,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:52,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:50:52,720 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:50:52,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 20:50:52,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:50:52,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:50:53,184 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3519)))) is different from true [2022-11-02 20:50:53,209 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3520) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:53,232 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3521)))) is different from true [2022-11-02 20:50:53,446 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3526)))) is different from true [2022-11-02 20:50:53,566 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3529)))) is different from true [2022-11-02 20:50:53,702 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3532) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:53,774 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3534)))) is different from true [2022-11-02 20:50:53,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3536)))) is different from true [2022-11-02 20:50:54,067 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3541)))) is different from true [2022-11-02 20:50:54,331 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3547) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:54,390 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3549) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:54,545 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553)))) is different from true [2022-11-02 20:50:54,661 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556)))) is different from true [2022-11-02 20:50:54,745 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:50:54,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:50:54,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:50:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 465 trivial. 494 not checked. [2022-11-02 20:50:54,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:55,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1466818717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:55,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:50:55,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 33 [2022-11-02 20:50:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081399959] [2022-11-02 20:50:55,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:50:55,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:50:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:50:55,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:50:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=118, Unknown=37, NotChecked=1170, Total=1406 [2022-11-02 20:50:55,236 INFO L87 Difference]: Start difference. First operand 1262 states and 1450 transitions. Second operand has 34 states, 32 states have (on average 3.75) internal successors, (120), 34 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:50:55,696 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3529))) (exists ((v_ArrVal_3519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3519))) (exists ((v_ArrVal_3526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3526))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058))) (exists ((v_ArrVal_3541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3541))) (exists ((v_ArrVal_3536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3536))) (exists ((v_ArrVal_3534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3534))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:55,704 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075))) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3520) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3529))) (exists ((v_ArrVal_3519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3519))) (exists ((v_ArrVal_3526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3526))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058))) (exists ((v_ArrVal_3541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3541))) (exists ((v_ArrVal_3536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3536))) (exists ((v_ArrVal_3534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3534))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:50:55,726 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556)))) is different from true [2022-11-02 20:51:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:01,067 INFO L93 Difference]: Finished difference Result 1649 states and 1956 transitions. [2022-11-02 20:51:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:01,069 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.75) internal successors, (120), 34 states have internal predecessors, (120), 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 117 [2022-11-02 20:51:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:01,071 INFO L225 Difference]: With dead ends: 1649 [2022-11-02 20:51:01,072 INFO L226 Difference]: Without dead ends: 1649 [2022-11-02 20:51:01,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 139 SyntacticMatches, 66 SemanticMatches, 41 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=100, Invalid=156, Unknown=42, NotChecked=1508, Total=1806 [2022-11-02 20:51:01,073 INFO L413 NwaCegarLoop]: 677 mSDtfsCounter, 721 mSDsluCounter, 2945 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 30449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28350 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:01,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 3622 Invalid, 30449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2092 Invalid, 0 Unknown, 28350 Unchecked, 5.5s Time] [2022-11-02 20:51:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2022-11-02 20:51:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1261. [2022-11-02 20:51:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 822 states have (on average 1.7420924574209247) internal successors, (1432), 1254 states have internal predecessors, (1432), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:51:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1449 transitions. [2022-11-02 20:51:01,098 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1449 transitions. Word has length 117 [2022-11-02 20:51:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:01,099 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1449 transitions. [2022-11-02 20:51:01,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.75) internal successors, (120), 34 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:51:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1449 transitions. [2022-11-02 20:51:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-02 20:51:01,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:01,101 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:01,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:01,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:01,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt [2022-11-02 20:51:01,517 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:51:01,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 826459512, now seen corresponding path program 1 times [2022-11-02 20:51:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:51:01,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117673445] [2022-11-02 20:51:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:01,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:51:01,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:51:01,519 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:51:01,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-02 20:51:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-02 20:51:02,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:02,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:51:02,827 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:51:02,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 20:51:02,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:51:03,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:51:05,132 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:05,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:51:05,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:05,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:51:05,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:51:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-02 20:51:05,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:05,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-02 20:51:05,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4072))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-02 20:51:05,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:51:05,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117673445] [2022-11-02 20:51:05,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117673445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:05,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1110604412] [2022-11-02 20:51:05,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:05,904 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:51:05,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:51:05,906 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:51:05,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-02 20:51:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:10,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-02 20:51:10,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:10,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:51:10,749 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 20:51:10,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 20:51:10,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:51:10,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:51:11,106 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456)))) is different from true [2022-11-02 20:51:11,866 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475)))) is different from true [2022-11-02 20:51:12,767 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:12,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:51:12,847 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:12,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:51:12,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:51:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-11-02 20:51:12,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:13,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4542))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-02 20:51:13,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1110604412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:13,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:51:13,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2022-11-02 20:51:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503105353] [2022-11-02 20:51:13,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:13,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:51:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:51:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:51:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=116, Unknown=16, NotChecked=130, Total=306 [2022-11-02 20:51:13,298 INFO L87 Difference]: Start difference. First operand 1261 states and 1449 transitions. Second operand has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:51:13,802 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3982))) (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4456))) (exists ((v_ArrVal_4475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4475)))) is different from true [2022-11-02 20:51:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:19,933 INFO L93 Difference]: Finished difference Result 1646 states and 1951 transitions. [2022-11-02 20:51:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:51:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-11-02 20:51:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:19,938 INFO L225 Difference]: With dead ends: 1646 [2022-11-02 20:51:19,938 INFO L226 Difference]: Without dead ends: 1646 [2022-11-02 20:51:19,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 147 SyntacticMatches, 89 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=59, Invalid=156, Unknown=19, NotChecked=186, Total=420 [2022-11-02 20:51:19,939 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 723 mSDsluCounter, 3407 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 4081 SdHoareTripleChecker+Invalid, 7445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5109 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:19,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 4081 Invalid, 7445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2327 Invalid, 0 Unknown, 5109 Unchecked, 6.4s Time] [2022-11-02 20:51:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-02 20:51:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1260. [2022-11-02 20:51:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 822 states have (on average 1.7408759124087592) internal successors, (1431), 1253 states have internal predecessors, (1431), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-02 20:51:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1448 transitions. [2022-11-02 20:51:19,959 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1448 transitions. Word has length 120 [2022-11-02 20:51:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:19,959 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1448 transitions. [2022-11-02 20:51:19,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:51:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1448 transitions. [2022-11-02 20:51:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-02 20:51:19,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:19,961 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:19,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:20,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:20,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:51:20,375 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-02 20:51:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 826459513, now seen corresponding path program 1 times [2022-11-02 20:51:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:51:20,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431340466] [2022-11-02 20:51:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:20,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:51:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:51:20,377 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:51:20,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-02 20:51:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:21,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-02 20:51:21,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:21,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 20:51:21,631 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 20:51:21,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 20:51:21,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:51:21,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:51:21,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:51:21,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:51:21,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-02 20:51:21,902 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925)))) is different from true [2022-11-02 20:51:21,918 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927)))) is different from true [2022-11-02 20:51:21,934 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929)))) is different from true [2022-11-02 20:51:21,950 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931)))) is different from true [2022-11-02 20:51:21,965 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4933))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4932)))) is different from true [2022-11-02 20:51:22,033 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4936))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4937 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4937) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:51:22,088 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4940 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4940) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4941)))) is different from true [2022-11-02 20:51:22,103 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942)))) is different from true [2022-11-02 20:51:22,155 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947)))) is different from true [2022-11-02 20:51:22,167 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949)))) is different from true [2022-11-02 20:51:22,230 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4952))) (exists ((v_ArrVal_4953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4953)))) is different from true [2022-11-02 20:51:22,246 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:51:22,377 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4961 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4961) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4960)))) is different from true [2022-11-02 20:51:22,478 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4967) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4966) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:51:22,538 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4970)))) is different from true [2022-11-02 20:51:22,680 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-02 20:51:22,763 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4985) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4984) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-02 20:51:22,775 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986)))) is different from true [2022-11-02 20:51:22,787 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989)))) is different from true [2022-11-02 20:51:22,799 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990)))) is different from true [2022-11-02 20:51:22,811 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4992)))) is different from true [2022-11-02 20:51:22,864 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4996))) (exists ((v_ArrVal_4997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4997)))) is different from true [2022-11-02 20:51:22,876 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998)))) is different from true [2022-11-02 20:51:23,006 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5006))) (exists ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5007) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:51:23,021 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008)))) is different from true [2022-11-02 20:51:23,037 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5011) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5010) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:51:23,090 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:23,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-02 20:51:23,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:51:23,240 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:51:23,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-02 20:51:23,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:51:23,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-02 20:51:23,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:51:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 819 not checked. [2022-11-02 20:51:23,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:23,541 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-02 20:51:23,587 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-02 20:51:24,677 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5104))) (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~mem38#1.base| v_ArrVal_5105) .cse0 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5105) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-02 20:51:24,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:51:24,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431340466] [2022-11-02 20:51:24,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431340466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:24,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1545499944] [2022-11-02 20:51:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-02 20:51:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 [2022-11-02 20:51:24,691 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-02 20:51:24,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15f86fc2-44b1-4b9d-b064-51c16699b678/bin/uautomizer-Dbtcem3rbc/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process