./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa --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 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:48:33,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:48:33,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:48:33,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:48:33,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:48:33,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:48:33,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:48:33,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:48:33,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:48:33,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:48:33,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:48:33,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:48:33,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:48:33,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:48:33,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:48:33,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:48:33,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:48:33,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:48:33,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:48:33,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:48:33,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:48:33,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:48:33,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:48:33,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:48:33,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:48:33,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:48:33,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:48:33,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:48:33,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:48:33,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:48:33,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:48:33,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:48:33,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:48:33,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:48:33,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:48:33,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:48:33,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:48:33,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:48:33,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:48:33,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:48:33,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:48:33,170 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 20:48:33,191 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:48:33,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:48:33,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:48:33,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:48:33,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:48:33,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:48:33,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:48:33,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:48:33,193 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:48:33,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:48:33,194 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 20:48:33,194 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 20:48:33,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:48:33,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 20:48:33,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:48:33,194 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 20:48:33,194 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 20:48:33,194 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 20:48:33,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:48:33,195 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 20:48:33,195 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 20:48:33,195 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:48:33,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:48:33,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:48:33,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:48:33,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:48:33,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:48:33,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:48:33,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:48:33,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:48:33,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:48:33,196 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_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/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_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa 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 -> 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e [2021-12-06 20:48:33,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:48:33,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:48:33,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:48:33,382 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:48:33,382 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:48:33,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2021-12-06 20:48:33,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data/68267311e/88a203a5e22e416eb2095f0b70fe8119/FLAG07c3cdbc5 [2021-12-06 20:48:33,900 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:48:33,900 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2021-12-06 20:48:33,914 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data/68267311e/88a203a5e22e416eb2095f0b70fe8119/FLAG07c3cdbc5 [2021-12-06 20:48:33,928 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data/68267311e/88a203a5e22e416eb2095f0b70fe8119 [2021-12-06 20:48:33,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:48:33,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:48:33,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:48:33,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:48:33,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:48:33,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:48:33" (1/1) ... [2021-12-06 20:48:33,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bef1f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:33, skipping insertion in model container [2021-12-06 20:48:33,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:48:33" (1/1) ... [2021-12-06 20:48:33,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:48:33,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:48:34,259 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_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i[33022,33035] [2021-12-06 20:48:34,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:48:34,408 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-06 20:48:34,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e5e8140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:34, skipping insertion in model container [2021-12-06 20:48:34,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:48:34,409 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-06 20:48:34,411 INFO L158 Benchmark]: Toolchain (without parser) took 478.37ms. Allocated memory is still 100.7MB. Free memory was 63.5MB in the beginning and 55.7MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 20:48:34,412 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 51.1MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 20:48:34,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.94ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 55.7MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 20:48:34,413 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.12ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 51.1MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.94ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 55.7MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa --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 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:48:35,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:48:35,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:48:35,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:48:35,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:48:35,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:48:35,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:48:35,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:48:35,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:48:35,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:48:35,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:48:35,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:48:35,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:48:35,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:48:35,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:48:35,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:48:35,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:48:35,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:48:35,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:48:35,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:48:35,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:48:35,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:48:35,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:48:35,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:48:35,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:48:35,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:48:35,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:48:35,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:48:35,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:48:35,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:48:35,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:48:35,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:48:35,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:48:35,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:48:35,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:48:35,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:48:35,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:48:35,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:48:35,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:48:35,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:48:35,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:48:35,916 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-06 20:48:35,935 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:48:35,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:48:35,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:48:35,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:48:35,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:48:35,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:48:35,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:48:35,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:48:35,937 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:48:35,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:48:35,937 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 20:48:35,938 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 20:48:35,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:48:35,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 20:48:35,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:48:35,938 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 20:48:35,938 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 20:48:35,938 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 20:48:35,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:48:35,939 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 20:48:35,939 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 20:48:35,939 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 20:48:35,939 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 20:48:35,939 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:48:35,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:48:35,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:48:35,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:48:35,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:48:35,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:48:35,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:48:35,940 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 20:48:35,940 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 20:48:35,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:48:35,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 20:48:35,941 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_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/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_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa 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 -> 93cc62483e7301c05d7788622f4f3fa5962cd13b8481778ecaf6adfc0416e51e [2021-12-06 20:48:36,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:48:36,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:48:36,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:48:36,196 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:48:36,196 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:48:36,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2021-12-06 20:48:36,240 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data/3769e1f14/d6592ab075ae4984a623752fcd44e95d/FLAG137ecb73c [2021-12-06 20:48:36,666 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:48:36,666 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i [2021-12-06 20:48:36,680 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data/3769e1f14/d6592ab075ae4984a623752fcd44e95d/FLAG137ecb73c [2021-12-06 20:48:36,969 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/data/3769e1f14/d6592ab075ae4984a623752fcd44e95d [2021-12-06 20:48:36,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:48:36,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:48:36,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:48:36,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:48:36,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:48:36,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:48:36" (1/1) ... [2021-12-06 20:48:36,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718e1c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:36, skipping insertion in model container [2021-12-06 20:48:36,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:48:36" (1/1) ... [2021-12-06 20:48:36,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:48:37,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:48:37,317 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_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i[33022,33035] [2021-12-06 20:48:37,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:48:37,491 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-06 20:48:37,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:48:37,542 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_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i[33022,33035] [2021-12-06 20:48:37,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:48:37,633 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:48:37,653 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_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-3.i[33022,33035] [2021-12-06 20:48:37,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:48:37,758 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:48:37,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37 WrapperNode [2021-12-06 20:48:37,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:48:37,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:48:37,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:48:37,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:48:37,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,881 INFO L137 Inliner]: procedures = 180, calls = 623, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2491 [2021-12-06 20:48:37,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:48:37,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:48:37,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:48:37,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:48:37,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:48:37,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:48:37,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:48:37,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:48:37,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (1/1) ... [2021-12-06 20:48:37,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:48:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:48:38,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:48:38,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:48:38,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-06 20:48:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2021-12-06 20:48:38,043 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2021-12-06 20:48:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-06 20:48:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 20:48:38,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 20:48:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-06 20:48:38,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-06 20:48:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 20:48:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:48:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 20:48:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 20:48:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-06 20:48:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 20:48:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 20:48:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-06 20:48:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 20:48:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:48:38,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:48:38,253 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:48:38,255 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:48:38,257 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-06 20:48:45,172 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:48:45,190 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:48:45,190 INFO L301 CfgBuilder]: Removed 168 assume(true) statements. [2021-12-06 20:48:45,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:48:45 BoogieIcfgContainer [2021-12-06 20:48:45,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:48:45,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:48:45,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:48:45,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:48:45,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:48:36" (1/3) ... [2021-12-06 20:48:45,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f34052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:48:45, skipping insertion in model container [2021-12-06 20:48:45,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:48:37" (2/3) ... [2021-12-06 20:48:45,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f34052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:48:45, skipping insertion in model container [2021-12-06 20:48:45,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:48:45" (3/3) ... [2021-12-06 20:48:45,199 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-3.i [2021-12-06 20:48:45,203 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:48:45,204 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1193 error locations. [2021-12-06 20:48:45,238 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:48:45,243 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 20:48:45,243 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1193 error locations. [2021-12-06 20:48:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 2437 states, 1232 states have (on average 2.2280844155844157) internal successors, (2745), 2423 states have internal predecessors, (2745), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-06 20:48:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 20:48:45,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:48:45,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 20:48:45,289 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:48:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2021-12-06 20:48:45,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:48:45,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597281241] [2021-12-06 20:48:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:45,302 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:48:45,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:48:45,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:48:45,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 20:48:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:45,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:48:45,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:48:45,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:48:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:48:45,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:48:45,511 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:48:45,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597281241] [2021-12-06 20:48:45,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597281241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:45,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:45,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 20:48:45,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197451899] [2021-12-06 20:48:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:45,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:48:45,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:48:45,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:48:45,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:48:45,545 INFO L87 Difference]: Start difference. First operand has 2437 states, 1232 states have (on average 2.2280844155844157) internal successors, (2745), 2423 states have internal predecessors, (2745), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:48:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:48:49,047 INFO L93 Difference]: Finished difference Result 3281 states and 3483 transitions. [2021-12-06 20:48:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:48:49,049 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 [2021-12-06 20:48:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:48:49,073 INFO L225 Difference]: With dead ends: 3281 [2021-12-06 20:48:49,073 INFO L226 Difference]: Without dead ends: 3279 [2021-12-06 20:48:49,074 INFO L932 BasicCegarLoop]: 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 [2021-12-06 20:48:49,076 INFO L933 BasicCegarLoop]: 1665 mSDtfsCounter, 2318 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2328 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:48:49,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2328 Valid, 2230 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-06 20:48:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2021-12-06 20:48:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2579. [2021-12-06 20:48:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 1398 states have (on average 2.067238912732475) internal successors, (2890), 2563 states have internal predecessors, (2890), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-06 20:48:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 2922 transitions. [2021-12-06 20:48:49,179 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 2922 transitions. Word has length 3 [2021-12-06 20:48:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:48:49,179 INFO L470 AbstractCegarLoop]: Abstraction has 2579 states and 2922 transitions. [2021-12-06 20:48:49,179 INFO L471 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) [2021-12-06 20:48:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 2922 transitions. [2021-12-06 20:48:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 20:48:49,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:48:49,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 20:48:49,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 20:48:49,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:48:49,381 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:48:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2021-12-06 20:48:49,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:48:49,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539706235] [2021-12-06 20:48:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:49,382 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:48:49,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:48:49,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:48:49,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 20:48:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:49,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:48:49,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:48:49,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:48:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:48:49,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:48:49,499 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:48:49,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539706235] [2021-12-06 20:48:49,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539706235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:49,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:49,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 20:48:49,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361364951] [2021-12-06 20:48:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:49,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:48:49,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:48:49,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:48:49,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:48:49,501 INFO L87 Difference]: Start difference. First operand 2579 states and 2922 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:48:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:48:54,876 INFO L93 Difference]: Finished difference Result 3727 states and 4170 transitions. [2021-12-06 20:48:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:48:54,877 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 [2021-12-06 20:48:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:48:54,891 INFO L225 Difference]: With dead ends: 3727 [2021-12-06 20:48:54,891 INFO L226 Difference]: Without dead ends: 3727 [2021-12-06 20:48:54,891 INFO L932 BasicCegarLoop]: 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 [2021-12-06 20:48:54,892 INFO L933 BasicCegarLoop]: 2045 mSDtfsCounter, 1240 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:48:54,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1244 Valid, 3433 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2021-12-06 20:48:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2021-12-06 20:48:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3028. [2021-12-06 20:48:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 1845 states have (on average 2.0233062330623306) internal successors, (3733), 3009 states have internal predecessors, (3733), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-06 20:48:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 3771 transitions. [2021-12-06 20:48:54,949 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 3771 transitions. Word has length 3 [2021-12-06 20:48:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:48:54,949 INFO L470 AbstractCegarLoop]: Abstraction has 3028 states and 3771 transitions. [2021-12-06 20:48:54,949 INFO L471 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) [2021-12-06 20:48:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3771 transitions. [2021-12-06 20:48:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-06 20:48:54,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:48:54,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:48:54,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-06 20:48:55,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:48:55,150 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:48:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:48:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2021-12-06 20:48:55,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:48:55,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842165421] [2021-12-06 20:48:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:48:55,152 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:48:55,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:48:55,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:48:55,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 20:48:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:48:55,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 20:48:55,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:48:55,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:48:55,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:48:55,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 20:48:55,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 20:48:55,349 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:48:55,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 20:48:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:48:55,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:48:55,370 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:48:55,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842165421] [2021-12-06 20:48:55,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842165421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:48:55,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:48:55,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:48:55,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344532413] [2021-12-06 20:48:55,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:48:55,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:48:55,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:48:55,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:48:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:48:55,371 INFO L87 Difference]: Start difference. First operand 3028 states and 3771 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:05,796 INFO L93 Difference]: Finished difference Result 6006 states and 6937 transitions. [2021-12-06 20:49:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:05,797 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 [2021-12-06 20:49:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:05,817 INFO L225 Difference]: With dead ends: 6006 [2021-12-06 20:49:05,818 INFO L226 Difference]: Without dead ends: 6006 [2021-12-06 20:49:05,818 INFO L932 BasicCegarLoop]: 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 [2021-12-06 20:49:05,819 INFO L933 BasicCegarLoop]: 981 mSDtfsCounter, 3127 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:05,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3137 Valid, 3162 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2021-12-06 20:49:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2021-12-06 20:49:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3747. [2021-12-06 20:49:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3747 states, 2564 states have (on average 2.0514820592823715) internal successors, (5260), 3722 states have internal predecessors, (5260), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3747 states to 3747 states and 5310 transitions. [2021-12-06 20:49:05,886 INFO L78 Accepts]: Start accepts. Automaton has 3747 states and 5310 transitions. Word has length 7 [2021-12-06 20:49:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:05,886 INFO L470 AbstractCegarLoop]: Abstraction has 3747 states and 5310 transitions. [2021-12-06 20:49:05,886 INFO L471 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) [2021-12-06 20:49:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3747 states and 5310 transitions. [2021-12-06 20:49:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-06 20:49:05,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:05,887 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:05,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 20:49:06,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:06,088 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:06,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:06,088 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2021-12-06 20:49:06,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:06,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323854751] [2021-12-06 20:49:06,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:06,089 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:06,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:06,090 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:06,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 20:49:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:06,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:06,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:06,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:49:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:06,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:06,218 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:06,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323854751] [2021-12-06 20:49:06,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323854751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:06,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:06,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 20:49:06,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738193311] [2021-12-06 20:49:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:06,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:49:06,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:06,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:49:06,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:06,219 INFO L87 Difference]: Start difference. First operand 3747 states and 5310 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:09,364 INFO L93 Difference]: Finished difference Result 4951 states and 6827 transitions. [2021-12-06 20:49:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:49:09,364 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 [2021-12-06 20:49:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:09,382 INFO L225 Difference]: With dead ends: 4951 [2021-12-06 20:49:09,382 INFO L226 Difference]: Without dead ends: 4951 [2021-12-06 20:49:09,383 INFO L932 BasicCegarLoop]: 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 [2021-12-06 20:49:09,383 INFO L933 BasicCegarLoop]: 2366 mSDtfsCounter, 1998 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:09,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2008 Valid, 3212 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-06 20:49:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2021-12-06 20:49:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 3656. [2021-12-06 20:49:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 2564 states have (on average 1.968408736349454) internal successors, (5047), 3631 states have internal predecessors, (5047), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5097 transitions. [2021-12-06 20:49:09,483 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5097 transitions. Word has length 8 [2021-12-06 20:49:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:09,484 INFO L470 AbstractCegarLoop]: Abstraction has 3656 states and 5097 transitions. [2021-12-06 20:49:09,484 INFO L471 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) [2021-12-06 20:49:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5097 transitions. [2021-12-06 20:49:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-06 20:49:09,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:09,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:09,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 20:49:09,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:09,689 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2021-12-06 20:49:09,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:09,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857770058] [2021-12-06 20:49:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:09,690 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:09,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:09,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:09,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 20:49:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:09,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:49:09,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:09,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:49:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:09,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:09,868 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857770058] [2021-12-06 20:49:09,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857770058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:09,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:09,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 20:49:09,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052569507] [2021-12-06 20:49:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:09,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:49:09,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:09,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:49:09,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:09,870 INFO L87 Difference]: Start difference. First operand 3656 states and 5097 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:15,006 INFO L93 Difference]: Finished difference Result 5371 states and 7455 transitions. [2021-12-06 20:49:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:49:15,007 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 [2021-12-06 20:49:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:15,026 INFO L225 Difference]: With dead ends: 5371 [2021-12-06 20:49:15,026 INFO L226 Difference]: Without dead ends: 5371 [2021-12-06 20:49:15,027 INFO L932 BasicCegarLoop]: 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 [2021-12-06 20:49:15,027 INFO L933 BasicCegarLoop]: 2746 mSDtfsCounter, 1369 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:15,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1373 Valid, 3931 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2021-12-06 20:49:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2021-12-06 20:49:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 3978. [2021-12-06 20:49:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 2896 states have (on average 1.9540745856353592) internal successors, (5659), 3953 states have internal predecessors, (5659), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5709 transitions. [2021-12-06 20:49:15,084 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5709 transitions. Word has length 8 [2021-12-06 20:49:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:15,084 INFO L470 AbstractCegarLoop]: Abstraction has 3978 states and 5709 transitions. [2021-12-06 20:49:15,084 INFO L471 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) [2021-12-06 20:49:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5709 transitions. [2021-12-06 20:49:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 20:49:15,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:15,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:15,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 20:49:15,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:15,286 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2021-12-06 20:49:15,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:15,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324832648] [2021-12-06 20:49:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:15,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:15,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:15,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:15,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 20:49:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:15,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:49:15,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:15,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:15,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:15,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324832648] [2021-12-06 20:49:15,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324832648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:15,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:15,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:15,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939785867] [2021-12-06 20:49:15,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:15,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:49:15,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:15,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:49:15,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:15,452 INFO L87 Difference]: Start difference. First operand 3978 states and 5709 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:15,483 INFO L93 Difference]: Finished difference Result 3918 states and 5623 transitions. [2021-12-06 20:49:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:49:15,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 20:49:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:15,496 INFO L225 Difference]: With dead ends: 3918 [2021-12-06 20:49:15,496 INFO L226 Difference]: Without dead ends: 3918 [2021-12-06 20:49:15,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:15,497 INFO L933 BasicCegarLoop]: 2407 mSDtfsCounter, 1197 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:15,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1201 Valid, 3623 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3918 states. [2021-12-06 20:49:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3918 to 3918. [2021-12-06 20:49:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 2860 states have (on average 1.9486013986013986) internal successors, (5573), 3893 states have internal predecessors, (5573), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5623 transitions. [2021-12-06 20:49:15,551 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5623 transitions. Word has length 11 [2021-12-06 20:49:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:15,551 INFO L470 AbstractCegarLoop]: Abstraction has 3918 states and 5623 transitions. [2021-12-06 20:49:15,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5623 transitions. [2021-12-06 20:49:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 20:49:15,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:15,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:15,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-06 20:49:15,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:15,752 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2021-12-06 20:49:15,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:15,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72724607] [2021-12-06 20:49:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:15,753 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:15,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:15,754 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:15,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 20:49:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:15,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:15,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:15,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:15,883 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:15,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72724607] [2021-12-06 20:49:15,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72724607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:15,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:15,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:49:15,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866388452] [2021-12-06 20:49:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:15,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:15,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:15,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:15,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:15,884 INFO L87 Difference]: Start difference. First operand 3918 states and 5623 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:15,943 INFO L93 Difference]: Finished difference Result 3890 states and 5567 transitions. [2021-12-06 20:49:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:15,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-06 20:49:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:15,951 INFO L225 Difference]: With dead ends: 3890 [2021-12-06 20:49:15,952 INFO L226 Difference]: Without dead ends: 3890 [2021-12-06 20:49:15,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:15,953 INFO L933 BasicCegarLoop]: 2362 mSDtfsCounter, 1168 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 5933 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:15,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1172 Valid, 5933 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2021-12-06 20:49:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3888. [2021-12-06 20:49:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 2844 states have (on average 1.939170182841069) internal successors, (5515), 3863 states have internal predecessors, (5515), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 5565 transitions. [2021-12-06 20:49:16,018 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 5565 transitions. Word has length 13 [2021-12-06 20:49:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:16,018 INFO L470 AbstractCegarLoop]: Abstraction has 3888 states and 5565 transitions. [2021-12-06 20:49:16,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 5565 transitions. [2021-12-06 20:49:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 20:49:16,020 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:16,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:16,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-06 20:49:16,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:16,220 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2021-12-06 20:49:16,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:16,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111176305] [2021-12-06 20:49:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:16,221 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:16,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:16,222 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:16,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-06 20:49:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:16,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:49:16,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:16,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:16,380 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:16,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111176305] [2021-12-06 20:49:16,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111176305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:16,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:16,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:16,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561478794] [2021-12-06 20:49:16,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:16,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:49:16,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:49:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:16,382 INFO L87 Difference]: Start difference. First operand 3888 states and 5565 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:16,420 INFO L93 Difference]: Finished difference Result 5514 states and 7318 transitions. [2021-12-06 20:49:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:49:16,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 20:49:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:16,429 INFO L225 Difference]: With dead ends: 5514 [2021-12-06 20:49:16,430 INFO L226 Difference]: Without dead ends: 5514 [2021-12-06 20:49:16,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:16,430 INFO L933 BasicCegarLoop]: 4091 mSDtfsCounter, 2288 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 5893 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:16,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2298 Valid, 5893 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states. [2021-12-06 20:49:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 3828. [2021-12-06 20:49:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3828 states, 2808 states have (on average 1.9334045584045585) internal successors, (5429), 3803 states have internal predecessors, (5429), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5479 transitions. [2021-12-06 20:49:16,474 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5479 transitions. Word has length 20 [2021-12-06 20:49:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:16,475 INFO L470 AbstractCegarLoop]: Abstraction has 3828 states and 5479 transitions. [2021-12-06 20:49:16,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5479 transitions. [2021-12-06 20:49:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 20:49:16,476 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:16,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:16,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-06 20:49:16,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:16,677 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:16,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2021-12-06 20:49:16,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:16,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654119741] [2021-12-06 20:49:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:16,680 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:16,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:16,683 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:16,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-06 20:49:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:16,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:49:16,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:16,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:16,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:16,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654119741] [2021-12-06 20:49:16,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654119741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:16,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:16,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:16,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449709869] [2021-12-06 20:49:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:16,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:49:16,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:16,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:49:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:16,939 INFO L87 Difference]: Start difference. First operand 3828 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:16,981 INFO L93 Difference]: Finished difference Result 5347 states and 7027 transitions. [2021-12-06 20:49:16,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:49:16,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 20:49:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:16,990 INFO L225 Difference]: With dead ends: 5347 [2021-12-06 20:49:16,990 INFO L226 Difference]: Without dead ends: 5347 [2021-12-06 20:49:16,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:16,991 INFO L933 BasicCegarLoop]: 3778 mSDtfsCounter, 2245 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 5532 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:16,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2255 Valid, 5532 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2021-12-06 20:49:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 3696. [2021-12-06 20:49:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2700 states have (on average 1.915185185185185) internal successors, (5171), 3671 states have internal predecessors, (5171), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5221 transitions. [2021-12-06 20:49:17,037 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5221 transitions. Word has length 20 [2021-12-06 20:49:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:17,037 INFO L470 AbstractCegarLoop]: Abstraction has 3696 states and 5221 transitions. [2021-12-06 20:49:17,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5221 transitions. [2021-12-06 20:49:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 20:49:17,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:17,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:17,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-06 20:49:17,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:17,239 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2021-12-06 20:49:17,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:17,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387246669] [2021-12-06 20:49:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:17,240 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:17,240 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:17,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-06 20:49:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:17,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:17,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:17,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:17,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:17,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387246669] [2021-12-06 20:49:17,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387246669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:17,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:17,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:49:17,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719776150] [2021-12-06 20:49:17,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:17,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:17,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:17,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:17,414 INFO L87 Difference]: Start difference. First operand 3696 states and 5221 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:17,492 INFO L93 Difference]: Finished difference Result 5312 states and 6961 transitions. [2021-12-06 20:49:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:17,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 20:49:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:17,500 INFO L225 Difference]: With dead ends: 5312 [2021-12-06 20:49:17,500 INFO L226 Difference]: Without dead ends: 5312 [2021-12-06 20:49:17,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:17,500 INFO L933 BasicCegarLoop]: 3960 mSDtfsCounter, 2216 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 9672 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:17,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2226 Valid, 9672 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2021-12-06 20:49:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 3666. [2021-12-06 20:49:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2684 states have (on average 1.9049925484351713) internal successors, (5113), 3641 states have internal predecessors, (5113), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 5163 transitions. [2021-12-06 20:49:17,540 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 5163 transitions. Word has length 22 [2021-12-06 20:49:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:17,541 INFO L470 AbstractCegarLoop]: Abstraction has 3666 states and 5163 transitions. [2021-12-06 20:49:17,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 5163 transitions. [2021-12-06 20:49:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 20:49:17,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:17,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:17,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-06 20:49:17,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:17,742 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2021-12-06 20:49:17,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:17,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182566553] [2021-12-06 20:49:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:17,743 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:17,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:17,744 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:17,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-06 20:49:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:17,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:17,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:17,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:17,899 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:17,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182566553] [2021-12-06 20:49:17,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182566553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:17,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:17,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:49:17,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021940641] [2021-12-06 20:49:17,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:17,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:17,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:17,901 INFO L87 Difference]: Start difference. First operand 3666 states and 5163 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:17,972 INFO L93 Difference]: Finished difference Result 5239 states and 6772 transitions. [2021-12-06 20:49:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:17,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 20:49:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:17,982 INFO L225 Difference]: With dead ends: 5239 [2021-12-06 20:49:17,982 INFO L226 Difference]: Without dead ends: 5239 [2021-12-06 20:49:17,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:17,983 INFO L933 BasicCegarLoop]: 3885 mSDtfsCounter, 2181 mSDsluCounter, 5597 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 9482 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:17,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2191 Valid, 9482 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2021-12-06 20:49:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 3604. [2021-12-06 20:49:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2636 states have (on average 1.8736722306525038) internal successors, (4939), 3579 states have internal predecessors, (4939), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4989 transitions. [2021-12-06 20:49:18,039 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4989 transitions. Word has length 22 [2021-12-06 20:49:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:18,039 INFO L470 AbstractCegarLoop]: Abstraction has 3604 states and 4989 transitions. [2021-12-06 20:49:18,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4989 transitions. [2021-12-06 20:49:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 20:49:18,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:18,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:18,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-06 20:49:18,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:18,241 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2021-12-06 20:49:18,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:18,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296253099] [2021-12-06 20:49:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:18,242 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:18,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:18,242 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:18,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-06 20:49:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:18,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:49:18,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:18,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:49:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:18,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:18,425 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:18,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296253099] [2021-12-06 20:49:18,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296253099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:18,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:18,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:18,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724044739] [2021-12-06 20:49:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:18,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:18,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:18,426 INFO L87 Difference]: Start difference. First operand 3604 states and 4989 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:22,095 INFO L93 Difference]: Finished difference Result 4225 states and 5525 transitions. [2021-12-06 20:49:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-06 20:49:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:22,100 INFO L225 Difference]: With dead ends: 4225 [2021-12-06 20:49:22,100 INFO L226 Difference]: Without dead ends: 4225 [2021-12-06 20:49:22,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:22,101 INFO L933 BasicCegarLoop]: 1515 mSDtfsCounter, 3097 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3103 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:22,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3103 Valid, 2793 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-06 20:49:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2021-12-06 20:49:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 3600. [2021-12-06 20:49:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2636 states have (on average 1.8706373292867982) internal successors, (4931), 3575 states have internal predecessors, (4931), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4981 transitions. [2021-12-06 20:49:22,135 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4981 transitions. Word has length 27 [2021-12-06 20:49:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:22,135 INFO L470 AbstractCegarLoop]: Abstraction has 3600 states and 4981 transitions. [2021-12-06 20:49:22,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4981 transitions. [2021-12-06 20:49:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 20:49:22,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:22,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:22,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-06 20:49:22,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:22,336 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:22,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2021-12-06 20:49:22,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:22,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442027907] [2021-12-06 20:49:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:22,337 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:22,338 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:22,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-06 20:49:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:22,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 20:49:22,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:22,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:49:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:22,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:22,559 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:22,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442027907] [2021-12-06 20:49:22,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442027907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:22,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:22,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:22,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335512486] [2021-12-06 20:49:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:22,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:22,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:22,560 INFO L87 Difference]: Start difference. First operand 3600 states and 4981 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:28,630 INFO L93 Difference]: Finished difference Result 4679 states and 6151 transitions. [2021-12-06 20:49:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:49:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-06 20:49:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:28,634 INFO L225 Difference]: With dead ends: 4679 [2021-12-06 20:49:28,634 INFO L226 Difference]: Without dead ends: 4679 [2021-12-06 20:49:28,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:28,635 INFO L933 BasicCegarLoop]: 1748 mSDtfsCounter, 2279 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2279 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:28,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2279 Valid, 4099 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2021-12-06 20:49:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2021-12-06 20:49:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 3636. [2021-12-06 20:49:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 2672 states have (on average 1.8607784431137724) internal successors, (4972), 3611 states have internal predecessors, (4972), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5022 transitions. [2021-12-06 20:49:28,670 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5022 transitions. Word has length 27 [2021-12-06 20:49:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:28,671 INFO L470 AbstractCegarLoop]: Abstraction has 3636 states and 5022 transitions. [2021-12-06 20:49:28,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5022 transitions. [2021-12-06 20:49:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 20:49:28,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:28,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:28,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-06 20:49:28,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:28,872 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2021-12-06 20:49:28,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:28,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039645131] [2021-12-06 20:49:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:28,874 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:28,874 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:28,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-06 20:49:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:29,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:49:29,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:29,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:49:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:29,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:29,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:29,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039645131] [2021-12-06 20:49:29,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039645131] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:29,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:29,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:29,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75434701] [2021-12-06 20:49:29,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:29,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:29,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:29,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:29,127 INFO L87 Difference]: Start difference. First operand 3636 states and 5022 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:34,574 INFO L93 Difference]: Finished difference Result 7033 states and 9556 transitions. [2021-12-06 20:49:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:49:34,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 20:49:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:34,581 INFO L225 Difference]: With dead ends: 7033 [2021-12-06 20:49:34,581 INFO L226 Difference]: Without dead ends: 7033 [2021-12-06 20:49:34,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:34,581 INFO L933 BasicCegarLoop]: 2580 mSDtfsCounter, 4500 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:34,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4507 Valid, 4978 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2021-12-06 20:49:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7033 states. [2021-12-06 20:49:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7033 to 3632. [2021-12-06 20:49:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 2672 states have (on average 1.8577844311377245) internal successors, (4964), 3607 states have internal predecessors, (4964), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5014 transitions. [2021-12-06 20:49:34,632 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5014 transitions. Word has length 36 [2021-12-06 20:49:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:34,633 INFO L470 AbstractCegarLoop]: Abstraction has 3632 states and 5014 transitions. [2021-12-06 20:49:34,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5014 transitions. [2021-12-06 20:49:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 20:49:34,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:34,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:34,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-06 20:49:34,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:34,834 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:34,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2021-12-06 20:49:34,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:34,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835420785] [2021-12-06 20:49:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:34,835 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:34,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:34,835 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:34,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-06 20:49:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 20:49:34,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:34,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:49:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:35,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:35,125 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:35,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835420785] [2021-12-06 20:49:35,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835420785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:35,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:35,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:35,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678608511] [2021-12-06 20:49:35,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:35,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:35,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:35,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:35,126 INFO L87 Difference]: Start difference. First operand 3632 states and 5014 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:43,026 INFO L93 Difference]: Finished difference Result 6725 states and 8957 transitions. [2021-12-06 20:49:43,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:49:43,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 20:49:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:43,031 INFO L225 Difference]: With dead ends: 6725 [2021-12-06 20:49:43,031 INFO L226 Difference]: Without dead ends: 6725 [2021-12-06 20:49:43,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:43,032 INFO L933 BasicCegarLoop]: 2937 mSDtfsCounter, 3252 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3256 SdHoareTripleChecker+Valid, 5833 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:43,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3256 Valid, 5833 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2021-12-06 20:49:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2021-12-06 20:49:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 3628. [2021-12-06 20:49:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 2672 states have (on average 1.8547904191616766) internal successors, (4956), 3603 states have internal predecessors, (4956), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 5006 transitions. [2021-12-06 20:49:43,084 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 5006 transitions. Word has length 36 [2021-12-06 20:49:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:43,084 INFO L470 AbstractCegarLoop]: Abstraction has 3628 states and 5006 transitions. [2021-12-06 20:49:43,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 5006 transitions. [2021-12-06 20:49:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 20:49:43,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:43,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:43,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-06 20:49:43,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:43,285 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:43,286 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2021-12-06 20:49:43,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:43,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144061754] [2021-12-06 20:49:43,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:43,286 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:43,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:43,287 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:43,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-06 20:49:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:49:43,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:43,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:49:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:43,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:43,483 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:43,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144061754] [2021-12-06 20:49:43,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144061754] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:43,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:43,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:43,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173709250] [2021-12-06 20:49:43,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:43,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:43,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:43,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:43,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:43,484 INFO L87 Difference]: Start difference. First operand 3628 states and 5006 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:49,580 INFO L93 Difference]: Finished difference Result 7477 states and 10068 transitions. [2021-12-06 20:49:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:49:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 20:49:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:49,587 INFO L225 Difference]: With dead ends: 7477 [2021-12-06 20:49:49,587 INFO L226 Difference]: Without dead ends: 7477 [2021-12-06 20:49:49,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:49,587 INFO L933 BasicCegarLoop]: 2542 mSDtfsCounter, 4861 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4871 SdHoareTripleChecker+Valid, 5133 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:49,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4871 Valid, 5133 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2021-12-06 20:49:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2021-12-06 20:49:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 3625. [2021-12-06 20:49:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2672 states have (on average 1.846556886227545) internal successors, (4934), 3600 states have internal predecessors, (4934), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4984 transitions. [2021-12-06 20:49:49,633 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4984 transitions. Word has length 36 [2021-12-06 20:49:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:49,633 INFO L470 AbstractCegarLoop]: Abstraction has 3625 states and 4984 transitions. [2021-12-06 20:49:49,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4984 transitions. [2021-12-06 20:49:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 20:49:49,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:49,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:49,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-06 20:49:49,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:49,835 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:49,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2021-12-06 20:49:49,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:49,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062180670] [2021-12-06 20:49:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:49,836 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:49,836 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:49,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-06 20:49:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:49,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 20:49:49,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:49,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:49:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:50,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:50,109 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:50,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062180670] [2021-12-06 20:49:50,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062180670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:50,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:50,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:50,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247217609] [2021-12-06 20:49:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:50,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:50,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:50,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:50,110 INFO L87 Difference]: Start difference. First operand 3625 states and 4984 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:57,105 INFO L93 Difference]: Finished difference Result 5561 states and 7343 transitions. [2021-12-06 20:49:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:49:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 20:49:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:57,110 INFO L225 Difference]: With dead ends: 5561 [2021-12-06 20:49:57,110 INFO L226 Difference]: Without dead ends: 5561 [2021-12-06 20:49:57,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:57,111 INFO L933 BasicCegarLoop]: 2838 mSDtfsCounter, 2602 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 5307 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:57,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2602 Valid, 5307 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2021-12-06 20:49:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states. [2021-12-06 20:49:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 3625. [2021-12-06 20:49:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2672 states have (on average 1.843562874251497) internal successors, (4926), 3600 states have internal predecessors, (4926), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4976 transitions. [2021-12-06 20:49:57,144 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4976 transitions. Word has length 36 [2021-12-06 20:49:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:57,145 INFO L470 AbstractCegarLoop]: Abstraction has 3625 states and 4976 transitions. [2021-12-06 20:49:57,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4976 transitions. [2021-12-06 20:49:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 20:49:57,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:57,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:57,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-06 20:49:57,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:57,346 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:57,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2021-12-06 20:49:57,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:57,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463154942] [2021-12-06 20:49:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:57,347 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:57,347 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:57,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-06 20:49:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:57,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:57,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:57,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:57,525 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:57,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463154942] [2021-12-06 20:49:57,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463154942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:57,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:57,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:49:57,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340089200] [2021-12-06 20:49:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:57,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:57,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:57,527 INFO L87 Difference]: Start difference. First operand 3625 states and 4976 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:57,567 INFO L93 Difference]: Finished difference Result 3613 states and 4952 transitions. [2021-12-06 20:49:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-06 20:49:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:57,571 INFO L225 Difference]: With dead ends: 3613 [2021-12-06 20:49:57,571 INFO L226 Difference]: Without dead ends: 3613 [2021-12-06 20:49:57,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:57,571 INFO L933 BasicCegarLoop]: 2193 mSDtfsCounter, 1152 mSDsluCounter, 3221 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 5414 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:57,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1156 Valid, 5414 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2021-12-06 20:49:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3613. [2021-12-06 20:49:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 2660 states have (on average 1.8428571428571427) internal successors, (4902), 3588 states have internal predecessors, (4902), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-06 20:49:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 4952 transitions. [2021-12-06 20:49:57,600 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 4952 transitions. Word has length 40 [2021-12-06 20:49:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:57,600 INFO L470 AbstractCegarLoop]: Abstraction has 3613 states and 4952 transitions. [2021-12-06 20:49:57,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 4952 transitions. [2021-12-06 20:49:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 20:49:57,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:57,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:57,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-06 20:49:57,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:57,801 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2021-12-06 20:49:57,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:57,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584204618] [2021-12-06 20:49:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:57,803 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:57,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:57,804 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:57,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-06 20:49:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:57,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:57,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:58,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:58,109 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:58,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584204618] [2021-12-06 20:49:58,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584204618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:58,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:58,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:58,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891065305] [2021-12-06 20:49:58,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:58,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:49:58,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:58,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:49:58,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:58,110 INFO L87 Difference]: Start difference. First operand 3613 states and 4952 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:58,360 INFO L93 Difference]: Finished difference Result 5433 states and 7161 transitions. [2021-12-06 20:49:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:49:58,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-06 20:49:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:58,365 INFO L225 Difference]: With dead ends: 5433 [2021-12-06 20:49:58,365 INFO L226 Difference]: Without dead ends: 5433 [2021-12-06 20:49:58,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:58,366 INFO L933 BasicCegarLoop]: 2282 mSDtfsCounter, 1568 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 4321 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:58,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1577 Valid, 4321 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2021-12-06 20:49:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 4630. [2021-12-06 20:49:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 3670 states have (on average 1.8258855585831062) internal successors, (6701), 4595 states have internal predecessors, (6701), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-06 20:49:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 6771 transitions. [2021-12-06 20:49:58,406 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 6771 transitions. Word has length 48 [2021-12-06 20:49:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:58,406 INFO L470 AbstractCegarLoop]: Abstraction has 4630 states and 6771 transitions. [2021-12-06 20:49:58,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 6771 transitions. [2021-12-06 20:49:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-06 20:49:58,406 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:58,407 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:58,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-06 20:49:58,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:58,608 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2021-12-06 20:49:58,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:58,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794298520] [2021-12-06 20:49:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:58,611 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:58,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:58,613 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:58,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-06 20:49:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:58,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:58,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:58,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:58,856 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:58,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794298520] [2021-12-06 20:49:58,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794298520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:58,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:58,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:49:58,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086283011] [2021-12-06 20:49:58,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:58,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:58,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:58,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:58,858 INFO L87 Difference]: Start difference. First operand 4630 states and 6771 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:58,927 INFO L93 Difference]: Finished difference Result 5942 states and 8145 transitions. [2021-12-06 20:49:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-06 20:49:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:58,933 INFO L225 Difference]: With dead ends: 5942 [2021-12-06 20:49:58,933 INFO L226 Difference]: Without dead ends: 5942 [2021-12-06 20:49:58,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:58,934 INFO L933 BasicCegarLoop]: 3432 mSDtfsCounter, 2151 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 8347 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:58,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2161 Valid, 8347 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2021-12-06 20:49:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 4588. [2021-12-06 20:49:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4588 states, 3628 states have (on average 1.8277287761852261) internal successors, (6631), 4553 states have internal predecessors, (6631), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-06 20:49:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 6701 transitions. [2021-12-06 20:49:58,975 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 6701 transitions. Word has length 51 [2021-12-06 20:49:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:58,976 INFO L470 AbstractCegarLoop]: Abstraction has 4588 states and 6701 transitions. [2021-12-06 20:49:58,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 6701 transitions. [2021-12-06 20:49:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-06 20:49:58,976 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:58,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:58,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-06 20:49:59,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:59,177 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:59,178 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2021-12-06 20:49:59,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:59,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614834410] [2021-12-06 20:49:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:59,181 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:59,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:59,183 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:59,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-06 20:49:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:59,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:59,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:49:59,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:59,509 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:49:59,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614834410] [2021-12-06 20:49:59,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614834410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:59,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:59,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:49:59,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992270451] [2021-12-06 20:49:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:59,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:59,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:49:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:49:59,510 INFO L87 Difference]: Start difference. First operand 4588 states and 6701 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:59,564 INFO L93 Difference]: Finished difference Result 5678 states and 7631 transitions. [2021-12-06 20:49:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:59,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-12-06 20:49:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:59,570 INFO L225 Difference]: With dead ends: 5678 [2021-12-06 20:49:59,570 INFO L226 Difference]: Without dead ends: 5678 [2021-12-06 20:49:59,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:59,570 INFO L933 BasicCegarLoop]: 3694 mSDtfsCounter, 2142 mSDsluCounter, 5226 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 8920 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:59,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2152 Valid, 8920 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2021-12-06 20:49:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 4570. [2021-12-06 20:49:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4570 states, 3610 states have (on average 1.8285318559556787) internal successors, (6601), 4535 states have internal predecessors, (6601), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-06 20:49:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 6671 transitions. [2021-12-06 20:49:59,610 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 6671 transitions. Word has length 54 [2021-12-06 20:49:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:59,610 INFO L470 AbstractCegarLoop]: Abstraction has 4570 states and 6671 transitions. [2021-12-06 20:49:59,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:49:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 6671 transitions. [2021-12-06 20:49:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:49:59,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:59,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:59,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-06 20:49:59,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:49:59,812 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:49:59,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash -345082942, now seen corresponding path program 1 times [2021-12-06 20:49:59,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:49:59,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831599488] [2021-12-06 20:49:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:59,815 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:49:59,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:49:59,817 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:49:59,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-06 20:50:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:00,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 20:50:00,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:00,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 20:50:00,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 20:50:00,132 INFO L354 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2021-12-06 20:50:00,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 36 [2021-12-06 20:50:00,160 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-06 20:50:00,161 INFO L388 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 60 treesize of output 20 [2021-12-06 20:50:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:00,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:50:00,220 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:00,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831599488] [2021-12-06 20:50:00,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831599488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:50:00,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:50:00,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:50:00,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110247247] [2021-12-06 20:50:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:50:00,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:50:00,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:50:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:50:00,222 INFO L87 Difference]: Start difference. First operand 4570 states and 6671 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:01,909 INFO L93 Difference]: Finished difference Result 4797 states and 6909 transitions. [2021-12-06 20:50:01,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:50:01,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-12-06 20:50:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:01,915 INFO L225 Difference]: With dead ends: 4797 [2021-12-06 20:50:01,915 INFO L226 Difference]: Without dead ends: 4797 [2021-12-06 20:50:01,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:50:01,916 INFO L933 BasicCegarLoop]: 2071 mSDtfsCounter, 1031 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:01,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1035 Valid, 5369 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 132 Unchecked, 1.6s Time] [2021-12-06 20:50:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2021-12-06 20:50:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4536. [2021-12-06 20:50:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3576 states have (on average 1.8361297539149888) internal successors, (6566), 4501 states have internal predecessors, (6566), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-06 20:50:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6636 transitions. [2021-12-06 20:50:01,966 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6636 transitions. Word has length 57 [2021-12-06 20:50:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:01,966 INFO L470 AbstractCegarLoop]: Abstraction has 4536 states and 6636 transitions. [2021-12-06 20:50:01,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6636 transitions. [2021-12-06 20:50:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 20:50:01,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:01,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:01,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-06 20:50:02,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:02,168 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2021-12-06 20:50:02,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:02,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625486390] [2021-12-06 20:50:02,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:50:02,171 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:02,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:02,172 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:02,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-06 20:50:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:02,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:50:02,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:02,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:50:02,642 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:02,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625486390] [2021-12-06 20:50:02,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625486390] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:50:02,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:50:02,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:50:02,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920627148] [2021-12-06 20:50:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:50:02,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:50:02,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:02,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:50:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:50:02,643 INFO L87 Difference]: Start difference. First operand 4536 states and 6636 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:02,783 INFO L93 Difference]: Finished difference Result 6338 states and 8912 transitions. [2021-12-06 20:50:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:50:02,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-12-06 20:50:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:02,795 INFO L225 Difference]: With dead ends: 6338 [2021-12-06 20:50:02,796 INFO L226 Difference]: Without dead ends: 6338 [2021-12-06 20:50:02,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:50:02,796 INFO L933 BasicCegarLoop]: 2414 mSDtfsCounter, 1265 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:02,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1273 Valid, 4482 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:50:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2021-12-06 20:50:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5609. [2021-12-06 20:50:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 4641 states have (on average 1.810385692738634) internal successors, (8402), 5563 states have internal predecessors, (8402), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 20:50:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 8494 transitions. [2021-12-06 20:50:02,837 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 8494 transitions. Word has length 59 [2021-12-06 20:50:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:02,837 INFO L470 AbstractCegarLoop]: Abstraction has 5609 states and 8494 transitions. [2021-12-06 20:50:02,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 8494 transitions. [2021-12-06 20:50:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 20:50:02,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:02,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:02,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-06 20:50:03,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:03,040 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2021-12-06 20:50:03,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:03,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041005743] [2021-12-06 20:50:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:50:03,043 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:03,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:03,045 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:03,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-06 20:50:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:03,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 20:50:03,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:03,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:50:03,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:50:03,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 20:50:03,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 20:50:03,709 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:50:03,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 20:50:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:03,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:50:03,718 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:03,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041005743] [2021-12-06 20:50:03,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041005743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:50:03,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:50:03,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:50:03,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157764104] [2021-12-06 20:50:03,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:50:03,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:50:03,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:03,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:50:03,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:50:03,719 INFO L87 Difference]: Start difference. First operand 5609 states and 8494 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:08,466 INFO L93 Difference]: Finished difference Result 8028 states and 12217 transitions. [2021-12-06 20:50:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:50:08,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-06 20:50:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:08,473 INFO L225 Difference]: With dead ends: 8028 [2021-12-06 20:50:08,474 INFO L226 Difference]: Without dead ends: 8028 [2021-12-06 20:50:08,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:50:08,474 INFO L933 BasicCegarLoop]: 1039 mSDtfsCounter, 2474 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:08,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2488 Valid, 1766 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2021-12-06 20:50:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8028 states. [2021-12-06 20:50:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8028 to 5369. [2021-12-06 20:50:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 4485 states have (on average 1.7438127090301003) internal successors, (7821), 5323 states have internal predecessors, (7821), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 20:50:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 7913 transitions. [2021-12-06 20:50:08,527 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 7913 transitions. Word has length 62 [2021-12-06 20:50:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:08,527 INFO L470 AbstractCegarLoop]: Abstraction has 5369 states and 7913 transitions. [2021-12-06 20:50:08,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 7913 transitions. [2021-12-06 20:50:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 20:50:08,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:08,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:08,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-06 20:50:08,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:08,728 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2021-12-06 20:50:08,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:08,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475169058] [2021-12-06 20:50:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:50:08,732 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:08,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:08,734 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:08,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-06 20:50:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:08,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 20:50:08,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:09,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:50:09,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:50:09,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 20:50:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:09,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:50:09,066 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:09,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475169058] [2021-12-06 20:50:09,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475169058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:50:09,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:50:09,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:50:09,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897335951] [2021-12-06 20:50:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:50:09,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:50:09,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:50:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:50:09,067 INFO L87 Difference]: Start difference. First operand 5369 states and 7913 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:13,247 INFO L93 Difference]: Finished difference Result 5368 states and 7910 transitions. [2021-12-06 20:50:13,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:50:13,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-12-06 20:50:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:13,251 INFO L225 Difference]: With dead ends: 5368 [2021-12-06 20:50:13,251 INFO L226 Difference]: Without dead ends: 5368 [2021-12-06 20:50:13,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:50:13,252 INFO L933 BasicCegarLoop]: 2112 mSDtfsCounter, 4 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5570 SdHoareTripleChecker+Invalid, 2884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:13,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 5570 Invalid, 2884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-12-06 20:50:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2021-12-06 20:50:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5368. [2021-12-06 20:50:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 4485 states have (on average 1.7431438127090302) internal successors, (7818), 5322 states have internal predecessors, (7818), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 20:50:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7910 transitions. [2021-12-06 20:50:13,296 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7910 transitions. Word has length 67 [2021-12-06 20:50:13,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:13,296 INFO L470 AbstractCegarLoop]: Abstraction has 5368 states and 7910 transitions. [2021-12-06 20:50:13,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7910 transitions. [2021-12-06 20:50:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 20:50:13,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:13,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:13,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-06 20:50:13,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:13,498 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2021-12-06 20:50:13,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:13,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179785942] [2021-12-06 20:50:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:50:13,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:13,503 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:13,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-06 20:50:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:13,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 20:50:13,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:13,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:50:13,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:50:13,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:50:13,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-06 20:50:13,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 20:50:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:13,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:50:13,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:13,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179785942] [2021-12-06 20:50:13,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179785942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:50:13,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:50:13,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:50:13,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012789838] [2021-12-06 20:50:13,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:50:13,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:50:13,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:13,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:50:13,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:50:13,858 INFO L87 Difference]: Start difference. First operand 5368 states and 7910 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:19,688 INFO L93 Difference]: Finished difference Result 5367 states and 7907 transitions. [2021-12-06 20:50:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:50:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-12-06 20:50:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:19,693 INFO L225 Difference]: With dead ends: 5367 [2021-12-06 20:50:19,693 INFO L226 Difference]: Without dead ends: 5367 [2021-12-06 20:50:19,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:50:19,693 INFO L933 BasicCegarLoop]: 2112 mSDtfsCounter, 2 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5571 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:19,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5571 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2021-12-06 20:50:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2021-12-06 20:50:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 5367. [2021-12-06 20:50:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5367 states, 4482 states have (on average 1.7436412315930387) internal successors, (7815), 5321 states have internal predecessors, (7815), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 20:50:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 7907 transitions. [2021-12-06 20:50:19,733 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 7907 transitions. Word has length 67 [2021-12-06 20:50:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:19,733 INFO L470 AbstractCegarLoop]: Abstraction has 5367 states and 7907 transitions. [2021-12-06 20:50:19,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 7907 transitions. [2021-12-06 20:50:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 20:50:19,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:19,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:19,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-06 20:50:19,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:19,935 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2021-12-06 20:50:19,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:19,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535712145] [2021-12-06 20:50:19,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:50:19,939 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:19,941 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:19,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-06 20:50:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:20,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 20:50:20,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:20,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:50:20,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:50:20,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 20:50:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:20,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:50:20,250 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535712145] [2021-12-06 20:50:20,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535712145] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:50:20,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:50:20,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:50:20,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518591073] [2021-12-06 20:50:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:50:20,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:50:20,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:20,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:50:20,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:50:20,251 INFO L87 Difference]: Start difference. First operand 5367 states and 7907 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:24,456 INFO L93 Difference]: Finished difference Result 5366 states and 7903 transitions. [2021-12-06 20:50:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:50:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-12-06 20:50:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:24,460 INFO L225 Difference]: With dead ends: 5366 [2021-12-06 20:50:24,460 INFO L226 Difference]: Without dead ends: 5366 [2021-12-06 20:50:24,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:50:24,461 INFO L933 BasicCegarLoop]: 2110 mSDtfsCounter, 4 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5565 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:24,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 5565 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-12-06 20:50:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5366 states. [2021-12-06 20:50:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5366 to 5366. [2021-12-06 20:50:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5366 states, 4482 states have (on average 1.7427487728692548) internal successors, (7811), 5320 states have internal predecessors, (7811), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 20:50:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5366 states to 5366 states and 7903 transitions. [2021-12-06 20:50:24,502 INFO L78 Accepts]: Start accepts. Automaton has 5366 states and 7903 transitions. Word has length 67 [2021-12-06 20:50:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:24,503 INFO L470 AbstractCegarLoop]: Abstraction has 5366 states and 7903 transitions. [2021-12-06 20:50:24,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5366 states and 7903 transitions. [2021-12-06 20:50:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 20:50:24,503 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:24,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:24,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-06 20:50:24,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:24,704 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2021-12-06 20:50:24,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:24,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431854492] [2021-12-06 20:50:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:50:24,706 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:24,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:24,707 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:24,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-06 20:50:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:24,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 20:50:24,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:25,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:50:25,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:50:25,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:50:25,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-06 20:50:25,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 20:50:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:25,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:50:25,099 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:25,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431854492] [2021-12-06 20:50:25,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431854492] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:50:25,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:50:25,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:50:25,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742263864] [2021-12-06 20:50:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:50:25,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:50:25,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:50:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:50:25,100 INFO L87 Difference]: Start difference. First operand 5366 states and 7903 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:31,171 INFO L93 Difference]: Finished difference Result 5365 states and 7899 transitions. [2021-12-06 20:50:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:50:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-12-06 20:50:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:31,176 INFO L225 Difference]: With dead ends: 5365 [2021-12-06 20:50:31,176 INFO L226 Difference]: Without dead ends: 5365 [2021-12-06 20:50:31,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:50:31,177 INFO L933 BasicCegarLoop]: 2110 mSDtfsCounter, 2 mSDsluCounter, 3456 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5566 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:31,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5566 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2021-12-06 20:50:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2021-12-06 20:50:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 5365. [2021-12-06 20:50:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4478 states have (on average 1.7434122376060741) internal successors, (7807), 5319 states have internal predecessors, (7807), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 20:50:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 7899 transitions. [2021-12-06 20:50:31,217 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 7899 transitions. Word has length 67 [2021-12-06 20:50:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:31,217 INFO L470 AbstractCegarLoop]: Abstraction has 5365 states and 7899 transitions. [2021-12-06 20:50:31,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:50:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 7899 transitions. [2021-12-06 20:50:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-06 20:50:31,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:31,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:31,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-06 20:50:31,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:31,419 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:31,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1243544783, now seen corresponding path program 1 times [2021-12-06 20:50:31,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:31,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384799445] [2021-12-06 20:50:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:50:31,423 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:31,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:31,426 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:31,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-06 20:50:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:31,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:50:31,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:31,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:50:31,792 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:31,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384799445] [2021-12-06 20:50:31,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384799445] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:50:31,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:50:31,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:50:31,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467110654] [2021-12-06 20:50:31,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:50:31,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:50:31,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:50:31,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:50:31,794 INFO L87 Difference]: Start difference. First operand 5365 states and 7899 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:50:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:31,853 INFO L93 Difference]: Finished difference Result 5368 states and 7908 transitions. [2021-12-06 20:50:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:50:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2021-12-06 20:50:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:31,861 INFO L225 Difference]: With dead ends: 5368 [2021-12-06 20:50:31,861 INFO L226 Difference]: Without dead ends: 5368 [2021-12-06 20:50:31,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:50:31,861 INFO L933 BasicCegarLoop]: 2109 mSDtfsCounter, 2 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6319 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:31,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 6319 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:50:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2021-12-06 20:50:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5368. [2021-12-06 20:50:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5368 states, 4480 states have (on average 1.7433035714285714) internal successors, (7810), 5322 states have internal predecessors, (7810), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-12-06 20:50:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7908 transitions. [2021-12-06 20:50:31,911 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7908 transitions. Word has length 75 [2021-12-06 20:50:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:31,912 INFO L470 AbstractCegarLoop]: Abstraction has 5368 states and 7908 transitions. [2021-12-06 20:50:31,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:50:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7908 transitions. [2021-12-06 20:50:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-06 20:50:31,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:31,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:31,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-12-06 20:50:32,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:32,113 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:32,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:32,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1194961360, now seen corresponding path program 1 times [2021-12-06 20:50:32,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:32,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672473415] [2021-12-06 20:50:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:50:32,117 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:32,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:32,119 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:32,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-06 20:50:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:50:32,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:50:32,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:32,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:50:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:32,629 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:32,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672473415] [2021-12-06 20:50:32,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672473415] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:50:32,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:50:32,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-06 20:50:32,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777309061] [2021-12-06 20:50:32,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:50:32,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:50:32,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:32,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:50:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:50:32,630 INFO L87 Difference]: Start difference. First operand 5368 states and 7908 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:50:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:32,821 INFO L93 Difference]: Finished difference Result 5380 states and 7930 transitions. [2021-12-06 20:50:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:50:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2021-12-06 20:50:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:32,831 INFO L225 Difference]: With dead ends: 5380 [2021-12-06 20:50:32,831 INFO L226 Difference]: Without dead ends: 5380 [2021-12-06 20:50:32,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:50:32,832 INFO L933 BasicCegarLoop]: 2109 mSDtfsCounter, 12 mSDsluCounter, 12611 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14720 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:32,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 14720 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:50:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2021-12-06 20:50:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 5378. [2021-12-06 20:50:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5378 states, 4489 states have (on average 1.7431499220316329) internal successors, (7825), 5331 states have internal predecessors, (7825), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-12-06 20:50:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 7923 transitions. [2021-12-06 20:50:32,883 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 7923 transitions. Word has length 76 [2021-12-06 20:50:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:32,883 INFO L470 AbstractCegarLoop]: Abstraction has 5378 states and 7923 transitions. [2021-12-06 20:50:32,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:50:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 7923 transitions. [2021-12-06 20:50:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-06 20:50:32,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:32,884 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:32,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-06 20:50:33,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:33,085 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1708838159, now seen corresponding path program 2 times [2021-12-06 20:50:33,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:33,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379616277] [2021-12-06 20:50:33,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 20:50:33,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:33,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:33,086 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:33,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-06 20:50:33,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 20:50:33,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:50:33,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 20:50:33,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:33,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:50:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:33,762 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:33,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379616277] [2021-12-06 20:50:33,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379616277] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:50:33,763 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:50:33,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-06 20:50:33,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789306429] [2021-12-06 20:50:33,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:50:33,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:50:33,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:33,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:50:33,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:50:33,764 INFO L87 Difference]: Start difference. First operand 5378 states and 7923 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:50:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:34,359 INFO L93 Difference]: Finished difference Result 5399 states and 7971 transitions. [2021-12-06 20:50:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 20:50:34,360 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 79 [2021-12-06 20:50:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:34,371 INFO L225 Difference]: With dead ends: 5399 [2021-12-06 20:50:34,371 INFO L226 Difference]: Without dead ends: 5395 [2021-12-06 20:50:34,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2021-12-06 20:50:34,372 INFO L933 BasicCegarLoop]: 2112 mSDtfsCounter, 56 mSDsluCounter, 16839 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 18951 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:34,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 18951 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:50:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2021-12-06 20:50:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 5387. [2021-12-06 20:50:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 4498 states have (on average 1.7423299244108492) internal successors, (7837), 5340 states have internal predecessors, (7837), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-12-06 20:50:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 7935 transitions. [2021-12-06 20:50:34,413 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 7935 transitions. Word has length 79 [2021-12-06 20:50:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:34,414 INFO L470 AbstractCegarLoop]: Abstraction has 5387 states and 7935 transitions. [2021-12-06 20:50:34,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:50:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 7935 transitions. [2021-12-06 20:50:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-06 20:50:34,414 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:34,414 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:34,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-06 20:50:34,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:34,616 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1472099985, now seen corresponding path program 3 times [2021-12-06 20:50:34,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:34,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383178597] [2021-12-06 20:50:34,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 20:50:34,620 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:34,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:34,622 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:34,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-06 20:50:35,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-06 20:50:35,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:50:35,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 20:50:35,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:35,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:50:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:36,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:36,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383178597] [2021-12-06 20:50:36,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383178597] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:50:36,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:50:36,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-06 20:50:36,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496516216] [2021-12-06 20:50:36,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:50:36,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 20:50:36,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:36,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 20:50:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-06 20:50:36,166 INFO L87 Difference]: Start difference. First operand 5387 states and 7935 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:50:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:39,489 INFO L93 Difference]: Finished difference Result 5429 states and 8072 transitions. [2021-12-06 20:50:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 20:50:39,490 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2021-12-06 20:50:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:39,502 INFO L225 Difference]: With dead ends: 5429 [2021-12-06 20:50:39,502 INFO L226 Difference]: Without dead ends: 5423 [2021-12-06 20:50:39,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2021-12-06 20:50:39,503 INFO L933 BasicCegarLoop]: 2116 mSDtfsCounter, 189 mSDsluCounter, 23219 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 25335 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:39,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 25335 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-06 20:50:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2021-12-06 20:50:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 5405. [2021-12-06 20:50:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5405 states, 4516 states have (on average 1.7404782993799823) internal successors, (7860), 5358 states have internal predecessors, (7860), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-12-06 20:50:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 7958 transitions. [2021-12-06 20:50:39,544 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 7958 transitions. Word has length 85 [2021-12-06 20:50:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:39,544 INFO L470 AbstractCegarLoop]: Abstraction has 5405 states and 7958 transitions. [2021-12-06 20:50:39,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:50:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 7958 transitions. [2021-12-06 20:50:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-06 20:50:39,545 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:39,545 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:39,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-12-06 20:50:39,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:39,746 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1934666287, now seen corresponding path program 4 times [2021-12-06 20:50:39,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:39,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365099656] [2021-12-06 20:50:39,750 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 20:50:39,750 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:39,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:39,752 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:39,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-06 20:50:40,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 20:50:40,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:50:40,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-06 20:50:40,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:40,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:50:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:50:41,888 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:41,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365099656] [2021-12-06 20:50:41,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365099656] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:50:41,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:50:41,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-06 20:50:41,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282317269] [2021-12-06 20:50:41,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:50:41,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 20:50:41,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:50:41,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 20:50:41,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 20:50:41,890 INFO L87 Difference]: Start difference. First operand 5405 states and 7958 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 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) [2021-12-06 20:50:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:50:54,716 INFO L93 Difference]: Finished difference Result 5485 states and 8175 transitions. [2021-12-06 20:50:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-06 20:50:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 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 97 [2021-12-06 20:50:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:50:54,723 INFO L225 Difference]: With dead ends: 5485 [2021-12-06 20:50:54,723 INFO L226 Difference]: Without dead ends: 5481 [2021-12-06 20:50:54,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-06 20:50:54,727 INFO L933 BasicCegarLoop]: 2129 mSDtfsCounter, 406 mSDsluCounter, 48856 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 50985 SdHoareTripleChecker+Invalid, 3467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:50:54,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 50985 Invalid, 3467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-06 20:50:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2021-12-06 20:50:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5439. [2021-12-06 20:50:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 4550 states have (on average 1.7375824175824175) internal successors, (7906), 5392 states have internal predecessors, (7906), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-12-06 20:50:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 8004 transitions. [2021-12-06 20:50:54,773 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 8004 transitions. Word has length 97 [2021-12-06 20:50:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:50:54,773 INFO L470 AbstractCegarLoop]: Abstraction has 5439 states and 8004 transitions. [2021-12-06 20:50:54,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 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) [2021-12-06 20:50:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 8004 transitions. [2021-12-06 20:50:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-06 20:50:54,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:50:54,774 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:50:54,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2021-12-06 20:50:54,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:50:54,975 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:50:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:50:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1997795441, now seen corresponding path program 5 times [2021-12-06 20:50:54,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:50:54,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117190536] [2021-12-06 20:50:54,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 20:50:54,976 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:50:54,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:50:54,977 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:50:54,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-06 20:50:56,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-06 20:50:56,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:50:56,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-06 20:50:56,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:50:56,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:50:56,400 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 20:50:56,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-06 20:50:56,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:50:56,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-06 20:50:57,421 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 1)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_17))) (and (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_19)))) (_ bv1 1)))))) (exists ((v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2640) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:50:58,539 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:50:58,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-06 20:50:58,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-06 20:50:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-06 20:50:58,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:50:58,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:50:58,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117190536] [2021-12-06 20:50:58,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117190536] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:50:58,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712157318] [2021-12-06 20:50:58,872 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 20:50:58,872 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 20:50:58,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 20:50:58,873 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 20:50:58,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-12-06 20:52:01,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-06 20:52:01,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:52:01,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-06 20:52:01,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:52:02,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:52:02,105 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 20:52:02,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-06 20:52:02,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:52:02,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-06 20:52:03,690 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 1)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_17))) (and (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_19)))) (_ bv1 1)))))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:04,111 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:52:04,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:52:04,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-06 20:52:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-06 20:52:04,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:52:04,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1712157318] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:52:04,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:52:04,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-12-06 20:52:04,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860016634] [2021-12-06 20:52:04,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:52:04,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:52:04,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:52:04,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:52:04,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=94, Unknown=13, NotChecked=42, Total=182 [2021-12-06 20:52:04,379 INFO L87 Difference]: Start difference. First operand 5439 states and 8004 transitions. Second operand has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:52:04,521 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2623) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 1)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_17))) (and (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg .cse0)) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_19)))) (_ bv1 1)))))) (exists ((v_ArrVal_3120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2640 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2640) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:52:07,168 INFO L93 Difference]: Finished difference Result 7994 states and 12060 transitions. [2021-12-06 20:52:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:52:07,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-12-06 20:52:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:52:07,179 INFO L225 Difference]: With dead ends: 7994 [2021-12-06 20:52:07,179 INFO L226 Difference]: Without dead ends: 7990 [2021-12-06 20:52:07,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 142 SyntacticMatches, 90 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=35, Invalid=95, Unknown=14, NotChecked=66, Total=210 [2021-12-06 20:52:07,179 INFO L933 BasicCegarLoop]: 1371 mSDtfsCounter, 1580 mSDsluCounter, 6467 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 7838 SdHoareTripleChecker+Invalid, 14170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12897 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-06 20:52:07,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1589 Valid, 7838 Invalid, 14170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1261 Invalid, 0 Unknown, 12897 Unchecked, 2.7s Time] [2021-12-06 20:52:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7990 states. [2021-12-06 20:52:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7990 to 5487. [2021-12-06 20:52:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5487 states, 4598 states have (on average 1.729447585906916) internal successors, (7952), 5439 states have internal predecessors, (7952), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-12-06 20:52:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 8050 transitions. [2021-12-06 20:52:07,232 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 8050 transitions. Word has length 119 [2021-12-06 20:52:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:52:07,233 INFO L470 AbstractCegarLoop]: Abstraction has 5487 states and 8050 transitions. [2021-12-06 20:52:07,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:52:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 8050 transitions. [2021-12-06 20:52:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-06 20:52:07,234 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:52:07,234 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:52:07,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-06 20:52:07,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2021-12-06 20:52:07,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 20:52:07,635 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:52:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:52:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1997795440, now seen corresponding path program 1 times [2021-12-06 20:52:07,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:52:07,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472588970] [2021-12-06 20:52:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:52:07,639 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:52:07,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:52:07,639 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:52:07,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-06 20:52:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:52:08,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-06 20:52:08,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:52:08,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:52:08,409 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:52:08,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-06 20:52:08,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:52:08,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:52:08,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:52:08,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 20:52:08,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-06 20:52:08,547 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552)))) is different from true [2021-12-06 20:52:08,557 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:08,566 WARN L860 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555)))) is different from true [2021-12-06 20:52:08,575 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558)))) is different from true [2021-12-06 20:52:08,640 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:08,675 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:08,683 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570)))) is different from true [2021-12-06 20:52:08,714 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:08,748 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:52:08,779 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:52:08,818 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:08,885 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:52:08,894 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:52:08,903 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596))) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:08,912 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:52:08,924 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:52:08,937 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602))) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:52:08,948 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603)))) is different from true [2021-12-06 20:52:08,957 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606)))) is different from true [2021-12-06 20:52:08,995 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:52:09,004 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:09,038 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:52:09,047 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2021-12-06 20:52:09,079 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:09,088 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:52:09,096 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626)))) is different from true [2021-12-06 20:52:09,105 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628)))) is different from true [2021-12-06 20:52:09,137 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:09,169 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:52:09,178 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:52:09,212 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:52:09,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:52:09,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:52:09,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-06 20:52:09,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 20:52:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 885 not checked. [2021-12-06 20:52:09,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:52:09,949 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |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~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-06 20:52:09,954 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:52:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472588970] [2021-12-06 20:52:09,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472588970] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:52:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1572025477] [2021-12-06 20:52:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:52:09,954 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 20:52:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 20:52:09,955 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 20:52:09,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2021-12-06 20:53:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:53:56,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-06 20:53:56,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:53:56,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:53:56,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:53:56,335 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:53:56,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 20:53:56,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:53:56,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:53:56,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 20:53:56,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-06 20:53:56,437 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106)))) is different from true [2021-12-06 20:53:56,446 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4108) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4109) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:53:56,478 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,487 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4114))) (exists ((v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4115) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,518 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,527 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121)))) is different from true [2021-12-06 20:53:56,537 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,546 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,604 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,636 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,644 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:53:56,652 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139)))) is different from true [2021-12-06 20:53:56,660 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,668 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4142) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,676 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,751 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,780 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157)))) is different from true [2021-12-06 20:53:56,813 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:53:56,822 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163)))) is different from true [2021-12-06 20:53:56,831 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165)))) is different from true [2021-12-06 20:53:56,863 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,921 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:53:56,929 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,939 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,950 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,960 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,969 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:56,979 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:56,989 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:53:57,025 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:53:57,053 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:53:57,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:53:57,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:53:57,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-06 20:53:57,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 20:53:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 885 not checked. [2021-12-06 20:53:57,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:53:57,679 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4284) |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~mem39#1.base| v_ArrVal_4285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-06 20:53:57,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1572025477] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:53:57,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:53:57,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 68 [2021-12-06 20:53:57,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823677653] [2021-12-06 20:53:57,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:53:57,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-12-06 20:53:57,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:53:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-12-06 20:53:57,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=143, Unknown=68, NotChecked=4898, Total=5256 [2021-12-06 20:53:57,687 INFO L87 Difference]: Start difference. First operand 5487 states and 8050 transitions. Second operand has 69 states, 67 states have (on average 2.3582089552238807) internal successors, (158), 69 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:53:58,188 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106)))) is different from true [2021-12-06 20:53:58,192 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4108) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4109) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:58,194 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (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_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555)))) is different from true [2021-12-06 20:53:58,202 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:53:58,211 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638))) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4114))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4115) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2021-12-06 20:53:58,227 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4114))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139))) (exists ((v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4115) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2021-12-06 20:53:58,238 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4114))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139))) (exists ((v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4115) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2021-12-06 20:53:58,251 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4142) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4114))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139))) (exists ((v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4115) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2021-12-06 20:53:58,264 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4142) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4114))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139))) (exists ((v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4115) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2021-12-06 20:53:58,323 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4140) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4180) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638))) (exists ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4164) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4136 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4136) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4162) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602))) (exists ((v_ArrVal_4185 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4185))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4175) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4137) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_ArrVal_3578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3578) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160))) (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_ArrVal_4176 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4176))) (exists ((v_ArrVal_4125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4131) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4122))) (exists ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3568))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179))) (exists ((v_ArrVal_4169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4169) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31))) (exists ((v_ArrVal_4143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4143) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4177) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4130) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596))) (exists ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3567) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4138) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4182))) (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4124) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4112) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4163 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4163))) (exists ((v_ArrVal_4113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4113) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4165))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4142) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4181) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4114))) (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4123) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4184) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628))) (exists ((v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4139))) (exists ((v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4115) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4141) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626))) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2021-12-06 20:53:58,327 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4192) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4193))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_31)))) is different from true [2021-12-06 20:54:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:54:07,435 INFO L93 Difference]: Finished difference Result 7989 states and 12051 transitions. [2021-12-06 20:54:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 20:54:07,435 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 2.3582089552238807) internal successors, (158), 69 states have internal predecessors, (158), 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 119 [2021-12-06 20:54:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:54:07,451 INFO L225 Difference]: With dead ends: 7989 [2021-12-06 20:54:07,451 INFO L226 Difference]: Without dead ends: 7989 [2021-12-06 20:54:07,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 143 SyntacticMatches, 31 SemanticMatches, 88 ConstructedPredicates, 73 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=272, Unknown=85, NotChecked=7446, Total=8010 [2021-12-06 20:54:07,453 INFO L933 BasicCegarLoop]: 1369 mSDtfsCounter, 1585 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 135281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130147 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:54:07,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1594 Valid, 5661 Invalid, 135281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5120 Invalid, 0 Unknown, 130147 Unchecked, 9.1s Time] [2021-12-06 20:54:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7989 states. [2021-12-06 20:54:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7989 to 5486. [2021-12-06 20:54:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5486 states, 4598 states have (on average 1.7287951283166594) internal successors, (7949), 5438 states have internal predecessors, (7949), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2021-12-06 20:54:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 8047 transitions. [2021-12-06 20:54:07,500 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 8047 transitions. Word has length 119 [2021-12-06 20:54:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:54:07,500 INFO L470 AbstractCegarLoop]: Abstraction has 5486 states and 8047 transitions. [2021-12-06 20:54:07,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 2.3582089552238807) internal successors, (158), 69 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:54:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 8047 transitions. [2021-12-06 20:54:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-06 20:54:07,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:54:07,501 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:54:07,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2021-12-06 20:54:07,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-12-06 20:54:07,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:54:07,902 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:54:07,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:54:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1938990661, now seen corresponding path program 1 times [2021-12-06 20:54:07,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:54:07,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180707161] [2021-12-06 20:54:07,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:54:07,903 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:54:07,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:54:07,904 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:54:07,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-06 20:54:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:54:08,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 20:54:08,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:54:08,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:54:08,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 20:54:08,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 20:54:08,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 20:54:08,556 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-06 20:54:08,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-06 20:54:08,620 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:54:08,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-06 20:54:08,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-12-06 20:54:08,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-12-06 20:54:08,817 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-06 20:54:08,817 INFO L388 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 67 treesize of output 23 [2021-12-06 20:54:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-12-06 20:54:08,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:54:08,912 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:54:08,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180707161] [2021-12-06 20:54:08,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180707161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:54:08,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:54:08,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:54:08,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305713664] [2021-12-06 20:54:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:54:08,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:54:08,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:54:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:54:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:54:08,920 INFO L87 Difference]: Start difference. First operand 5486 states and 8047 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:54:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:54:15,329 INFO L93 Difference]: Finished difference Result 5667 states and 7978 transitions. [2021-12-06 20:54:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:54:15,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-12-06 20:54:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:54:15,334 INFO L225 Difference]: With dead ends: 5667 [2021-12-06 20:54:15,334 INFO L226 Difference]: Without dead ends: 5667 [2021-12-06 20:54:15,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:54:15,335 INFO L933 BasicCegarLoop]: 1415 mSDtfsCounter, 2097 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2107 SdHoareTripleChecker+Valid, 4656 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:54:15,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2107 Valid, 4656 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3187 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2021-12-06 20:54:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5667 states. [2021-12-06 20:54:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5667 to 5085. [2021-12-06 20:54:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5085 states, 4198 states have (on average 1.752501191043354) internal successors, (7357), 5040 states have internal predecessors, (7357), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-06 20:54:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5085 states to 5085 states and 7448 transitions. [2021-12-06 20:54:15,371 INFO L78 Accepts]: Start accepts. Automaton has 5085 states and 7448 transitions. Word has length 119 [2021-12-06 20:54:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:54:15,371 INFO L470 AbstractCegarLoop]: Abstraction has 5085 states and 7448 transitions. [2021-12-06 20:54:15,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:54:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5085 states and 7448 transitions. [2021-12-06 20:54:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-06 20:54:15,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:54:15,372 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:54:15,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-12-06 20:54:15,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:54:15,573 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:54:15,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:54:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -961839399, now seen corresponding path program 1 times [2021-12-06 20:54:15,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:54:15,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88946350] [2021-12-06 20:54:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:54:15,577 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:54:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:54:15,580 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:54:15,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-12-06 20:54:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:54:16,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-06 20:54:16,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:54:16,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:54:16,403 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 20:54:16,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-12-06 20:54:16,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:54:16,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-06 20:54:17,104 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5054) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:17,667 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5068) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:17,903 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5074) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:17,930 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5075) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:18,207 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5082) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:18,425 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:54:18,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:54:18,521 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:54:18,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:54:18,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-06 20:54:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2021-12-06 20:54:18,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:54:18,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))))) (_ bv0 1))) is different from false [2021-12-06 20:54:18,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:54:18,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5132))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:54:18,861 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:54:18,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88946350] [2021-12-06 20:54:18,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88946350] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:54:18,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1839355255] [2021-12-06 20:54:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:54:18,861 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 20:54:18,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 20:54:18,862 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 20:54:18,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2021-12-06 20:54:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:54:21,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-06 20:54:21,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:54:21,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:54:21,989 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 20:54:21,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-06 20:54:22,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:54:22,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-06 20:54:22,376 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:23,672 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_55 (_ BitVec 32)) (v_arrayElimCell_53 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_53))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)))) (= (_ bv0 1) (bvadd (_ bv1 1) .cse0)) (not (= v_arrayElimCell_55 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| v_arrayElimCell_55)))))))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:24,093 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:54:24,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-06 20:54:24,167 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:54:24,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:54:24,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-06 20:54:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2021-12-06 20:54:24,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:54:24,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5602))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:54:24,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1839355255] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:54:24,437 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:54:24,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2021-12-06 20:54:24,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350856985] [2021-12-06 20:54:24,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:54:24,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 20:54:24,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:54:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 20:54:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=122, Unknown=22, NotChecked=352, Total=552 [2021-12-06 20:54:24,438 INFO L87 Difference]: Start difference. First operand 5085 states and 7448 transitions. Second operand has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 17 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:54:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:54:27,215 INFO L93 Difference]: Finished difference Result 7540 states and 11397 transitions. [2021-12-06 20:54:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:54:27,215 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 17 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2021-12-06 20:54:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:54:27,221 INFO L225 Difference]: With dead ends: 7540 [2021-12-06 20:54:27,221 INFO L226 Difference]: Without dead ends: 7540 [2021-12-06 20:54:27,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 149 SyntacticMatches, 86 SemanticMatches, 22 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=56, Invalid=122, Unknown=22, NotChecked=352, Total=552 [2021-12-06 20:54:27,222 INFO L933 BasicCegarLoop]: 1374 mSDtfsCounter, 1574 mSDsluCounter, 6171 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 7545 SdHoareTripleChecker+Invalid, 23428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22158 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-06 20:54:27,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1583 Valid, 7545 Invalid, 23428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1258 Invalid, 0 Unknown, 22158 Unchecked, 2.7s Time] [2021-12-06 20:54:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2021-12-06 20:54:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5084. [2021-12-06 20:54:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5084 states, 4198 states have (on average 1.7517865650309672) internal successors, (7354), 5039 states have internal predecessors, (7354), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-06 20:54:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5084 states to 5084 states and 7445 transitions. [2021-12-06 20:54:27,265 INFO L78 Accepts]: Start accepts. Automaton has 5084 states and 7445 transitions. Word has length 122 [2021-12-06 20:54:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:54:27,265 INFO L470 AbstractCegarLoop]: Abstraction has 5084 states and 7445 transitions. [2021-12-06 20:54:27,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.066666666666666) internal successors, (91), 17 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:54:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 7445 transitions. [2021-12-06 20:54:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-06 20:54:27,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:54:27,266 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:54:27,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2021-12-06 20:54:27,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (40)] Ended with exit code 0 [2021-12-06 20:54:27,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:54:27,668 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:54:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:54:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -961839398, now seen corresponding path program 1 times [2021-12-06 20:54:27,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:54:27,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152040567] [2021-12-06 20:54:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:54:27,671 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:54:27,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:54:27,671 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:54:27,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2021-12-06 20:54:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:54:28,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-06 20:54:28,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:54:28,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:54:28,601 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:54:28,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-06 20:54:28,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:54:28,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:54:28,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:54:28,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 20:54:28,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-06 20:54:28,807 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:28,862 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:28,872 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996)))) is different from true [2021-12-06 20:54:28,881 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998)))) is different from true [2021-12-06 20:54:28,911 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002)))) is different from true [2021-12-06 20:54:28,919 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:28,926 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:28,955 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011)))) is different from true [2021-12-06 20:54:28,963 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:29,016 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018)))) is different from true [2021-12-06 20:54:29,050 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023)))) is different from true [2021-12-06 20:54:29,081 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:54:29,089 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:29,147 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035)))) is different from true [2021-12-06 20:54:29,156 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036))) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:29,189 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:29,346 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055)))) is different from true [2021-12-06 20:54:29,354 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:54:29,362 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058)))) is different from true [2021-12-06 20:54:29,371 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060)))) is different from true [2021-12-06 20:54:29,380 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062))) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:29,388 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:54:29,494 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:54:29,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:54:29,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:54:29,578 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:54:29,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:54:29,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:54:29,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-06 20:54:29,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 20:54:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2021-12-06 20:54:29,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:54:29,789 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-06 20:54:29,818 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-06 20:54:30,430 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6164)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165) .cse2 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-06 20:54:30,439 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:54:30,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152040567] [2021-12-06 20:54:30,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152040567] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:54:30,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1892989443] [2021-12-06 20:54:30,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:54:30,440 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 20:54:30,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 20:54:30,440 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 20:54:30,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2021-12-06 20:56:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:56:27,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2021-12-06 20:56:27,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:56:27,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:56:28,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:56:28,031 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:56:28,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 20:56:28,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:56:28,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:56:28,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 20:56:28,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-06 20:56:28,134 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6547) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6548)))) is different from true [2021-12-06 20:56:28,143 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6549))) (exists ((v_ArrVal_6550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6550) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,152 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,314 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,397 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574)))) is different from true [2021-12-06 20:56:28,527 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,662 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,672 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6599) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6600) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:28,728 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605))) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,762 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,780 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6612) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6611) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,792 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,829 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,894 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:28,930 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:28,994 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634)))) is different from true [2021-12-06 20:56:29,023 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:56:29,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:56:29,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:56:29,083 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:56:29,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:56:29,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:56:29,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-06 20:56:29,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 20:56:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 584 not checked. [2021-12-06 20:56:29,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:56:29,163 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-06 20:56:29,198 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-06 20:56:29,742 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728) .cse2 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-06 20:56:29,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1892989443] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:56:29,751 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:56:29,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 47 [2021-12-06 20:56:29,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666232432] [2021-12-06 20:56:29,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:56:29,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-06 20:56:29,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:56:29,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-06 20:56:29,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=142, Unknown=51, NotChecked=2772, Total=3080 [2021-12-06 20:56:29,753 INFO L87 Difference]: Start difference. First operand 5084 states and 7445 transitions. Second operand has 48 states, 46 states have (on average 3.0) internal successors, (138), 48 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:56:30,119 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6547) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6548))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:30,126 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585))) (exists ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6549))) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055))) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605))) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:30,136 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036))) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6599) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6612) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585))) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6600) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605))) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:30,146 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036))) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6599) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6612) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585))) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6600) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:30,156 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036))) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6599) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6612) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585))) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6600) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058))) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:30,167 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036))) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062))) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6599) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056))) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6612) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585))) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6600) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6611) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058))) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:30,201 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_69 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_69) (_ bv44 32))) (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:56:39,436 INFO L93 Difference]: Finished difference Result 7539 states and 11394 transitions. [2021-12-06 20:56:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 20:56:39,437 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 3.0) internal successors, (138), 48 states have internal predecessors, (138), 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 122 [2021-12-06 20:56:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:56:39,442 INFO L225 Difference]: With dead ends: 7539 [2021-12-06 20:56:39,443 INFO L226 Difference]: Without dead ends: 7539 [2021-12-06 20:56:39,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 149 SyntacticMatches, 54 SemanticMatches, 68 ConstructedPredicates, 51 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=307, Unknown=65, NotChecked=4284, Total=4830 [2021-12-06 20:56:39,444 INFO L933 BasicCegarLoop]: 1373 mSDtfsCounter, 1583 mSDsluCounter, 4942 mSDsCounter, 0 mSdLazyCounter, 5139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 6315 SdHoareTripleChecker+Invalid, 120230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115075 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:56:39,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1592 Valid, 6315 Invalid, 120230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5139 Invalid, 0 Unknown, 115075 Unchecked, 9.2s Time] [2021-12-06 20:56:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2021-12-06 20:56:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 5083. [2021-12-06 20:56:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5083 states, 4198 states have (on average 1.7510719390185803) internal successors, (7351), 5038 states have internal predecessors, (7351), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-06 20:56:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 7442 transitions. [2021-12-06 20:56:39,486 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 7442 transitions. Word has length 122 [2021-12-06 20:56:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:56:39,486 INFO L470 AbstractCegarLoop]: Abstraction has 5083 states and 7442 transitions. [2021-12-06 20:56:39,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 3.0) internal successors, (138), 48 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:56:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 7442 transitions. [2021-12-06 20:56:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-12-06 20:56:39,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:56:39,487 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:56:39,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2021-12-06 20:56:39,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2021-12-06 20:56:39,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:56:39,889 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:56:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:56:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1864593015, now seen corresponding path program 1 times [2021-12-06 20:56:39,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:56:39,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620388377] [2021-12-06 20:56:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:56:39,893 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:56:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:56:39,894 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:56:39,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2021-12-06 20:56:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:56:40,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 115 conjunts are in the unsatisfiable core [2021-12-06 20:56:40,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:56:40,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:56:40,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:56:40,966 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:56:40,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 20:56:40,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:56:40,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:56:41,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 20:56:41,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-06 20:56:41,156 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130)))) is different from true [2021-12-06 20:56:41,286 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:41,295 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:41,303 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145)))) is different from true [2021-12-06 20:56:41,334 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:41,344 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:41,362 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 20:56:41,371 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156)))) is different from true [2021-12-06 20:56:41,379 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 20:56:41,388 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:41,420 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,428 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,436 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:41,444 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,452 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171)))) is different from true [2021-12-06 20:56:41,460 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173)))) is different from true [2021-12-06 20:56:41,467 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7175) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7176) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,523 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:41,531 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,539 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:56:41,547 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188)))) is different from true [2021-12-06 20:56:41,555 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,586 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,595 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195)))) is different from true [2021-12-06 20:56:41,604 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,613 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,621 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201)))) is different from true [2021-12-06 20:56:41,684 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:56:41,692 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209)))) is different from true [2021-12-06 20:56:41,746 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:56:41,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:56:41,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:56:41,833 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:56:41,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:56:41,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:56:41,912 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:56:41,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:56:41,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:56:41,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-06 20:56:41,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 20:56:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 870 not checked. [2021-12-06 20:56:41,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:56:42,116 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32)))))) is different from false [2021-12-06 20:56:42,147 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))) is different from false [2021-12-06 20:56:42,226 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7213)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7214) .cse0 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7214) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-06 20:56:42,353 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7214) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7215)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_7213))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_7214) .cse4 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-06 20:56:43,410 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7308)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7213))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7307) .cse0 v_ArrVal_7214) .cse1 v_ArrVal_7215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7308))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7307) .cse6 v_ArrVal_7214) (select (select (store .cse7 .cse6 v_ArrVal_7213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_7215))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5))))) is different from false [2021-12-06 20:56:43,426 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:56:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620388377] [2021-12-06 20:56:43,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620388377] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:56:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [814285986] [2021-12-06 20:56:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:56:43,427 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 20:56:43,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 20:56:43,427 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 20:56:43,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2021-12-06 20:57:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:57:30,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 117 conjunts are in the unsatisfiable core [2021-12-06 20:57:30,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:57:30,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:57:31,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:57:31,154 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:57:31,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-06 20:57:31,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:57:31,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:57:31,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 20:57:31,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-06 20:57:31,554 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:57:31,572 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:57:31,591 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7717) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:31,611 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719)))) is different from true [2021-12-06 20:57:31,683 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 20:57:31,702 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:31,769 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:31,789 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 20:57:32,062 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:57:32,081 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:32,163 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:32,191 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752)))) is different from true [2021-12-06 20:57:32,215 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754)))) is different from true [2021-12-06 20:57:32,344 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:57:32,422 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:32,502 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:32,628 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:57:32,648 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776)))) is different from true [2021-12-06 20:57:32,769 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781)))) is different from true [2021-12-06 20:57:32,789 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:32,808 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:32,827 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787)))) is different from true [2021-12-06 20:57:32,896 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32)))) is different from true [2021-12-06 20:57:32,960 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:57:32,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:57:32,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:57:33,080 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:57:33,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:57:33,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:57:33,171 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:57:33,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 20:57:33,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 20:57:33,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-06 20:57:33,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 20:57:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 759 not checked. [2021-12-06 20:57:33,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:57:33,305 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-06 20:57:33,343 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-06 20:57:33,479 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7793) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7794)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7793) .cse2 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-06 20:57:33,569 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7793) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7795)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_7794))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_7793) .cse4 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-06 20:57:34,826 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7887))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7888) .cse1 v_ArrVal_7793) (select (select (store .cse2 .cse1 v_ArrVal_7794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7795))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7887)) (.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7794))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7888) .cse4 v_ArrVal_7793) .cse5 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7796) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-06 20:57:34,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [814285986] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:57:34,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:57:34,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 33] total 62 [2021-12-06 20:57:34,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782937550] [2021-12-06 20:57:34,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:57:34,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-12-06 20:57:34,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:57:34,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-12-06 20:57:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=179, Unknown=70, NotChecked=5146, Total=5550 [2021-12-06 20:57:34,842 INFO L87 Difference]: Start difference. First operand 5083 states and 7442 transitions. Second operand has 63 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 63 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:57:35,826 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:57:35,840 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 20:57:35,857 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197))) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732))) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144))) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195))) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145))) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7717) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:35,873 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144))) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195))) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7717) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:35,890 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144))) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195))) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7717) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:35,909 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144))) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195))) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7717) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:57:35,927 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7186) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7157 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7157) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7725))) (exists ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7197))) (exists ((v_ArrVal_7720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7720) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7791 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7791) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7764))) (exists ((v_ArrVal_7202 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7202))) (exists ((v_ArrVal_7193 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7193))) (exists ((v_ArrVal_7750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7750) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7746))) (exists ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7142))) (exists ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7713) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7154) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7158 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7158))) (exists ((v_ArrVal_7792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7792) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7760) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7183) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7149) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7775) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7783) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7153 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7153) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7166) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7724))) (exists ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7723) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7732 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7732))) (exists ((v_ArrVal_7169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7169) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7731) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7125) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7788) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7146) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7167 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7167))) (exists ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7196) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7774 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7774) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7182))) (exists ((v_arrayElimCell_89 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_89) (_ bv44 32))) (exists ((v_ArrVal_7753 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7753) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7759) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7152))) (exists ((v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7767) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7200) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7187) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7141) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7719))) (exists ((v_ArrVal_7160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7160))) (exists ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7787))) (exists ((v_ArrVal_7210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7210) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7198) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7181) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7129) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7194) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7751) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7729))) (exists ((v_ArrVal_7754 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7754))) (exists ((v_ArrVal_7718 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7718) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7150) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7776))) (exists ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7165 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7165) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7151 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7151) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7763) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7773 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7773) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7163) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7785) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7716 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7716) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7130 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7130))) (exists ((v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7782) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7185) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7164) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7168) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7174) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7209))) (exists ((v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7144))) (exists ((v_ArrVal_7199 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7199) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7781 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7781))) (exists ((v_ArrVal_7159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7175) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7715) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7784) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7190) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7768) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7745) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7188))) (exists ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7184) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7195))) (exists ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7145))) (exists ((v_ArrVal_7155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7155) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7714 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7714) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7726) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7189) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7786) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7744) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7172) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7156))) (exists ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7730) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7126))) (exists ((v_ArrVal_7171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7171))) (exists ((v_ArrVal_7749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7749) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7743) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7752))) (exists ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7176) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7173))) (exists ((v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7201))) (exists ((v_ArrVal_7207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7207) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7717 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7717) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:07,453 INFO L93 Difference]: Finished difference Result 7538 states and 11391 transitions. [2021-12-06 20:58:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 20:58:07,454 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 63 states have internal predecessors, (152), 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 125 [2021-12-06 20:58:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:07,460 INFO L225 Difference]: With dead ends: 7538 [2021-12-06 20:58:07,461 INFO L226 Difference]: Without dead ends: 7538 [2021-12-06 20:58:07,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 157 SyntacticMatches, 39 SemanticMatches, 88 ConstructedPredicates, 69 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=221, Invalid=390, Unknown=85, NotChecked=7314, Total=8010 [2021-12-06 20:58:07,464 INFO L933 BasicCegarLoop]: 1372 mSDtfsCounter, 1584 mSDsluCounter, 6744 mSDsCounter, 0 mSdLazyCounter, 9010 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 8116 SdHoareTripleChecker+Invalid, 122473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 9010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113445 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:07,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1593 Valid, 8116 Invalid, 122473 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 9010 Invalid, 0 Unknown, 113445 Unchecked, 31.5s Time] [2021-12-06 20:58:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2021-12-06 20:58:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 5082. [2021-12-06 20:58:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5082 states, 4198 states have (on average 1.7503573130061933) internal successors, (7348), 5037 states have internal predecessors, (7348), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-06 20:58:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5082 states to 5082 states and 7439 transitions. [2021-12-06 20:58:07,512 INFO L78 Accepts]: Start accepts. Automaton has 5082 states and 7439 transitions. Word has length 125 [2021-12-06 20:58:07,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:07,512 INFO L470 AbstractCegarLoop]: Abstraction has 5082 states and 7439 transitions. [2021-12-06 20:58:07,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 63 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 20:58:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5082 states and 7439 transitions. [2021-12-06 20:58:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-12-06 20:58:07,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:07,513 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:07,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2021-12-06 20:58:07,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (44)] Ended with exit code 0 [2021-12-06 20:58:07,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 20:58:07,914 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:58:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1864593014, now seen corresponding path program 1 times [2021-12-06 20:58:07,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:58:07,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921450173] [2021-12-06 20:58:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:07,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:58:07,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:58:07,919 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:58:07,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2021-12-06 20:58:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:08,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 20:58:08,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:58:08,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:58:09,101 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 20:58:09,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-12-06 20:58:09,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:58:09,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-06 20:58:10,447 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8290) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:10,635 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8292) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:10,706 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8293) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:11,276 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8299) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:11,339 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8300) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:11,799 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8305) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:11,968 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8307) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:12,029 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8308) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:12,476 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313)))) is different from true [2021-12-06 20:58:13,611 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:58:13,928 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:58:13,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:58:14,144 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:58:14,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-06 20:58:14,357 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:58:14,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:58:14,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-06 20:58:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 395 not checked. [2021-12-06 20:58:14,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:58:14,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (_ bv1 1)))) is different from false [2021-12-06 20:58:14,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8327))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:58:14,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8327))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (_ bv1 1)) (_ bv0 1))) is different from false [2021-12-06 20:58:14,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8327))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:58:15,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8327 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8374))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8327)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8328)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:58:15,173 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:58:15,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921450173] [2021-12-06 20:58:15,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921450173] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:58:15,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1707747467] [2021-12-06 20:58:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:15,174 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 20:58:15,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 20:58:15,175 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 20:58:15,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2021-12-06 20:59:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:03,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-06 20:59:03,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:03,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:59:04,272 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 20:59:04,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-12-06 20:59:04,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:59:04,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-06 20:59:04,857 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8770) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:05,404 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8776) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:05,753 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8780) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:06,120 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8784) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:07,072 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8794) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:08,317 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8807) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:09,029 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:59:09,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:59:09,162 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:59:09,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2021-12-06 20:59:09,303 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:59:09,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:59:09,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-06 20:59:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2021-12-06 20:59:09,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:59:09,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8814) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))))))) (_ bv1 1)) (_ bv0 1))) is different from false [2021-12-06 20:59:09,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:09,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:09,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:09,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8860))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8813)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:09,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1707747467] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:09,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:59:09,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 26 [2021-12-06 20:59:09,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654063562] [2021-12-06 20:59:09,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:59:09,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-06 20:59:09,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 20:59:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-06 20:59:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=157, Unknown=38, NotChecked=1274, Total=1560 [2021-12-06 20:59:09,925 INFO L87 Difference]: Start difference. First operand 5082 states and 7439 transitions. Second operand has 27 states, 25 states have (on average 4.4) internal successors, (110), 27 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:59:10,072 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8299) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8780) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8784) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8305) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8290) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8283) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8770) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:10,081 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_111 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_111))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg .cse0))))) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| v_arrayElimCell_113))) (_ bv1 1))) (not (= v_arrayElimCell_113 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))))) (exists ((v_ArrVal_8308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8307 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8307) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8325 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8325) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8292) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8313))) (exists ((v_ArrVal_8794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8794) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8299) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8776) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8780 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8780) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8784 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8784) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8305) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8290 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8290) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8283) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8300 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8300) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8807 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8807) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8293 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8293) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8770) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:15,441 INFO L93 Difference]: Finished difference Result 7537 states and 11388 transitions. [2021-12-06 20:59:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:59:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 4.4) internal successors, (110), 27 states have internal predecessors, (110), 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 125 [2021-12-06 20:59:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:15,450 INFO L225 Difference]: With dead ends: 7537 [2021-12-06 20:59:15,451 INFO L226 Difference]: Without dead ends: 7537 [2021-12-06 20:59:15,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 152 SyntacticMatches, 78 SemanticMatches, 40 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=95, Invalid=159, Unknown=40, NotChecked=1428, Total=1722 [2021-12-06 20:59:15,452 INFO L933 BasicCegarLoop]: 1372 mSDtfsCounter, 1570 mSDsluCounter, 5801 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 7173 SdHoareTripleChecker+Invalid, 54808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53541 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:15,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1579 Valid, 7173 Invalid, 54808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1255 Invalid, 0 Unknown, 53541 Unchecked, 5.3s Time] [2021-12-06 20:59:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7537 states. [2021-12-06 20:59:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7537 to 5081. [2021-12-06 20:59:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5081 states, 4198 states have (on average 1.7496426869938067) internal successors, (7345), 5036 states have internal predecessors, (7345), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-06 20:59:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 7436 transitions. [2021-12-06 20:59:15,501 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 7436 transitions. Word has length 125 [2021-12-06 20:59:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:15,502 INFO L470 AbstractCegarLoop]: Abstraction has 5081 states and 7436 transitions. [2021-12-06 20:59:15,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 4.4) internal successors, (110), 27 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 20:59:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 7436 transitions. [2021-12-06 20:59:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-06 20:59:15,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:15,502 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:15,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2021-12-06 20:59:15,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (47)] Ended with exit code 0 [2021-12-06 20:59:15,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 20:59:15,903 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 20:59:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1278777568, now seen corresponding path program 1 times [2021-12-06 20:59:15,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 20:59:15,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638084142] [2021-12-06 20:59:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:15,908 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 20:59:15,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 20:59:15,910 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 20:59:15,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2021-12-06 20:59:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:16,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 20:59:16,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:16,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 20:59:17,229 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 20:59:17,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-06 20:59:17,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 20:59:17,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-06 20:59:20,157 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_129 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_127)))) (and (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_129)))) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (not (= v_arrayElimCell_129 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))))) (exists ((v_ArrVal_9295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9295) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:20,838 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_129 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_127)))) (and (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_129)))) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (not (= v_arrayElimCell_129 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))))) (exists ((v_ArrVal_9302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9302) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 20:59:22,167 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:59:22,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-12-06 20:59:22,384 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:59:22,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:59:22,582 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:59:22,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-12-06 20:59:22,807 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:59:22,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 20:59:22,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-06 20:59:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2021-12-06 20:59:22,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:59:23,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_9316) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:23,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:23,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:23,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:23,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9314))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:23,232 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9314))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:23,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9362))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9314)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 20:59:23,635 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 20:59:23,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638084142] [2021-12-06 20:59:23,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638084142] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:23,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [259588335] [2021-12-06 20:59:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:23,635 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 20:59:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 20:59:23,636 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 20:59:23,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2021-12-06 21:00:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:00:27,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 21:00:27,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:00:27,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 21:00:28,149 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 21:00:28,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-06 21:00:28,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:00:28,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-06 21:00:33,144 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:00:33,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-06 21:00:33,375 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:00:33,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-06 21:00:33,526 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:00:33,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2021-12-06 21:00:33,648 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:00:33,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-12-06 21:00:33,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2021-12-06 21:00:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2021-12-06 21:00:33,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:00:33,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_9818) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))))) (_ bv1 1)))) is different from false [2021-12-06 21:00:33,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:00:33,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2021-12-06 21:00:33,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2021-12-06 21:00:33,922 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9816))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:00:33,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9816))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:00:34,360 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9864))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9816)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))))))) is different from false [2021-12-06 21:00:34,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [259588335] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:00:34,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:00:34,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 13 [2021-12-06 21:00:34,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419315373] [2021-12-06 21:00:34,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:00:34,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 21:00:34,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:00:34,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 21:00:34,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=146, Unknown=27, NotChecked=624, Total=870 [2021-12-06 21:00:34,368 INFO L87 Difference]: Start difference. First operand 5081 states and 7436 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 21:00:34,509 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9270) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_129 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (v_arrayElimCell_127 (_ BitVec 1))) (let ((.cse0 (bvneg (bvneg v_arrayElimCell_127)))) (and (= (_ bv0 1) (bvadd .cse0 (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_129)))) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) (not (= v_arrayElimCell_129 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|))))) (exists ((v_ArrVal_9302 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9302) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9295) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:00:39,598 INFO L93 Difference]: Finished difference Result 7536 states and 11385 transitions. [2021-12-06 21:00:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 21:00:39,598 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 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 128 [2021-12-06 21:00:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:00:39,606 INFO L225 Difference]: With dead ends: 7536 [2021-12-06 21:00:39,606 INFO L226 Difference]: Without dead ends: 7536 [2021-12-06 21:00:39,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 159 SyntacticMatches, 93 SemanticMatches, 29 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=75, Invalid=147, Unknown=28, NotChecked=680, Total=930 [2021-12-06 21:00:39,607 INFO L933 BasicCegarLoop]: 1372 mSDtfsCounter, 1566 mSDsluCounter, 6631 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 8003 SdHoareTripleChecker+Invalid, 15300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14036 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:00:39,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1575 Valid, 8003 Invalid, 15300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1252 Invalid, 0 Unknown, 14036 Unchecked, 5.1s Time] [2021-12-06 21:00:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2021-12-06 21:00:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 5080. [2021-12-06 21:00:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4198 states have (on average 1.7489280609814197) internal successors, (7342), 5035 states have internal predecessors, (7342), 43 states have call successors, (43), 5 states have call predecessors, (43), 6 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2021-12-06 21:00:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 7433 transitions. [2021-12-06 21:00:39,656 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 7433 transitions. Word has length 128 [2021-12-06 21:00:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:00:39,656 INFO L470 AbstractCegarLoop]: Abstraction has 5080 states and 7433 transitions. [2021-12-06 21:00:39,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 21:00:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 7433 transitions. [2021-12-06 21:00:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-12-06 21:00:39,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:00:39,657 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:00:39,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (49)] Ended with exit code 0 [2021-12-06 21:00:39,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (48)] Ended with exit code 0 [2021-12-06 21:00:40,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:00:40,058 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1189 more)] === [2021-12-06 21:00:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:00:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1278777569, now seen corresponding path program 1 times [2021-12-06 21:00:40,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:00:40,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121459592] [2021-12-06 21:00:40,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:00:40,063 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:00:40,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:00:40,065 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:00:40,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2021-12-06 21:00:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:00:41,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-06 21:00:41,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:00:41,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 21:00:41,388 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:00:41,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-06 21:00:41,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 21:00:41,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:00:41,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 21:00:41,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 21:00:41,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-06 21:00:41,754 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10277 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10277))) (exists ((v_ArrVal_10276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10276) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 21:00:41,863 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10281) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10280 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10280)))) is different from true [2021-12-06 21:00:41,887 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10282) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10283 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10283) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 21:00:41,910 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10284) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10285 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10285) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:41,934 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10287 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10287) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10286) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:41,956 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10289) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10288) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147)))) is different from true [2021-12-06 21:00:42,086 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10294 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10294))) (exists ((v_ArrVal_10295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10295) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,166 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10299))) (exists ((v_ArrVal_10298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10298)))) is different from true [2021-12-06 21:00:42,188 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10300))) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10301) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,210 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10302))) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10303) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,231 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10304) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10305 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10305) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,310 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10308) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10309)))) is different from true [2021-12-06 21:00:42,332 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10311) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10310))) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147)))) is different from true [2021-12-06 21:00:42,475 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10317) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10316) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 21:00:42,498 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10319) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10318 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10318) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,522 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10320))) (exists ((v_ArrVal_10321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10321) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,800 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10331) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10330) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,892 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10335 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10335))) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10334 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10334) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,920 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10337 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10337))) (exists ((v_ArrVal_10336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10336) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:42,945 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10338) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10339) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 21:00:43,151 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10347 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10347) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_10346 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10346)))) is different from true [2021-12-06 21:00:43,227 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10350) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_10351 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10351) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:43,248 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10353 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10353))) (exists ((v_ArrVal_10352 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10352) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147)))) is different from true [2021-12-06 21:00:43,374 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_147 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_147))) (exists ((v_ArrVal_10358 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10358))) (exists ((v_ArrVal_10359 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_10359) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 21:00:43,548 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:00:43,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 21:00:43,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 21:00:43,739 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:00:43,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 21:00:43,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 21:00:43,929 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:00:43,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 21:00:43,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 21:00:44,128 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:00:44,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 21:00:44,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 21:00:44,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 21:00:44,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-06 21:00:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 190 trivial. 780 not checked. [2021-12-06 21:00:44,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:00:44,579 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32)))))) is different from false [2021-12-06 21:00:44,622 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))) is different from false [2021-12-06 21:00:44,751 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10366)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10367) .cse0 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10367) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32)))))) is different from false [2021-12-06 21:00:44,932 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10366))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10367) .cse1 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10367) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_10369)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))) is different from false [2021-12-06 21:00:46,973 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10364)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10366))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10365) .cse0 v_ArrVal_10367) .cse1 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10364))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10365) .cse6 v_ArrVal_10367) (select (select (store .cse7 .cse6 v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_10369))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32)))))) is different from false [2021-12-06 21:00:49,062 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10364))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10365) .cse2 v_ArrVal_10367) (select (select (store .cse3 .cse2 v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10369)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10364))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_10366))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10365) .cse6 v_ArrVal_10367) .cse7 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))))))))))) is different from false [2021-12-06 21:00:52,700 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10461))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10364))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10460) .cse1 v_ArrVal_10365) .cse2 v_ArrVal_10367) (select (select (store .cse3 .cse2 v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10369))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10461)) (.cse9 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_10364))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_10366))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10460) .cse6 v_ArrVal_10365) .cse7 v_ArrVal_10367) .cse8 v_ArrVal_10369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_10368) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))))))))))) is different from false [2021-12-06 21:00:52,722 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:00:52,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121459592] [2021-12-06 21:00:52,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121459592] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:00:52,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1536212338] [2021-12-06 21:00:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:00:52,722 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 21:00:52,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 21:00:52,723 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 21:00:52,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee800d8-a6c1-4c64-a09c-b30b24d149f8/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process