./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.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_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/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_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/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_b6755c33-a115-48e6-8695-507f9acccdfd/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 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:14:02,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:14:02,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:14:02,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:14:02,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:14:02,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:14:02,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:14:02,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:14:02,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:14:02,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:14:02,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:14:02,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:14:02,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:14:02,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:14:02,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:14:02,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:14:02,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:14:02,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:14:02,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:14:02,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:14:02,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:14:02,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:14:02,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:14:02,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:14:02,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:14:02,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:14:02,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:14:02,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:14:02,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:14:02,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:14:02,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:14:02,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:14:02,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:14:02,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:14:02,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:14:02,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:14:02,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:14:02,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:14:02,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:14:02,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:14:02,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:14:02,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 17:14:02,732 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:14:02,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:14:02,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:14:02,732 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:14:02,733 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:14:02,733 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:14:02,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:14:02,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:14:02,733 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:14:02,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 17:14:02,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:14:02,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:14:02,735 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:14:02,735 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:14:02,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:14:02,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:14:02,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:14:02,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:14:02,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:14:02,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:14:02,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:14:02,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:14:02,736 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:14:02,736 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_b6755c33-a115-48e6-8695-507f9acccdfd/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_b6755c33-a115-48e6-8695-507f9acccdfd/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 -> 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 [2021-12-06 17:14:02,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:14:02,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:14:02,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:14:02,947 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:14:02,948 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:14:02,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2021-12-06 17:14:02,993 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data/a573d649a/e1d5d7216dff4af685275f858a9403bf/FLAG23e56d507 [2021-12-06 17:14:03,451 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:14:03,451 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2021-12-06 17:14:03,465 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data/a573d649a/e1d5d7216dff4af685275f858a9403bf/FLAG23e56d507 [2021-12-06 17:14:03,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data/a573d649a/e1d5d7216dff4af685275f858a9403bf [2021-12-06 17:14:03,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:14:03,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:14:03,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:14:03,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:14:03,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:14:03,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:03" (1/1) ... [2021-12-06 17:14:03,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beb0268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:03, skipping insertion in model container [2021-12-06 17:14:03,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:03" (1/1) ... [2021-12-06 17:14:03,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:14:03,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:14:03,839 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_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[33021,33034] [2021-12-06 17:14:03,937 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_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[49681,49694] [2021-12-06 17:14:03,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:14:03,956 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 17:14:03,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4283fc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:03, skipping insertion in model container [2021-12-06 17:14:03,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:14:03,957 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-06 17:14:03,959 INFO L158 Benchmark]: Toolchain (without parser) took 479.20ms. Allocated memory is still 109.1MB. Free memory was 64.7MB in the beginning and 68.8MB in the end (delta: -4.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2021-12-06 17:14:03,959 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:14:03,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.97ms. Allocated memory is still 109.1MB. Free memory was 64.4MB in the beginning and 68.8MB in the end (delta: -4.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2021-12-06 17:14:03,961 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.15ms. Allocated memory is still 109.1MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.97ms. Allocated memory is still 109.1MB. Free memory was 64.4MB in the beginning and 68.8MB in the end (delta: -4.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types 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_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/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_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/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_b6755c33-a115-48e6-8695-507f9acccdfd/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 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:14:05,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:14:05,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:14:05,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:14:05,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:14:05,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:14:05,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:14:05,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:14:05,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:14:05,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:14:05,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:14:05,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:14:05,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:14:05,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:14:05,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:14:05,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:14:05,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:14:05,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:14:05,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:14:05,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:14:05,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:14:05,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:14:05,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:14:05,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:14:05,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:14:05,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:14:05,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:14:05,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:14:05,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:14:05,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:14:05,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:14:05,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:14:05,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:14:05,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:14:05,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:14:05,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:14:05,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:14:05,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:14:05,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:14:05,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:14:05,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:14:05,368 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-06 17:14:05,393 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:14:05,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:14:05,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:14:05,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:14:05,394 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:14:05,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:14:05,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:14:05,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:14:05,394 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:14:05,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:14:05,395 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:14:05,395 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:14:05,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:14:05,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:14:05,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:14:05,395 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 17:14:05,396 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 17:14:05,396 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 17:14:05,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:14:05,396 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:14:05,396 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 17:14:05,396 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 17:14:05,396 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:14:05,396 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:14:05,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:14:05,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:14:05,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:14:05,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:14:05,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:14:05,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:14:05,397 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 17:14:05,397 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 17:14:05,398 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:14:05,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 17:14:05,398 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_b6755c33-a115-48e6-8695-507f9acccdfd/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_b6755c33-a115-48e6-8695-507f9acccdfd/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 -> 7770ba1119c1ebb05279b2f71af570d7d6521032dfc344bf6d89fc60d99335e2 [2021-12-06 17:14:05,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:14:05,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:14:05,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:14:05,649 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:14:05,650 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:14:05,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2021-12-06 17:14:05,693 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data/7f81fcdad/c301d21464174ad7808532d4bf688c4a/FLAGf8c1b8c1d [2021-12-06 17:14:06,201 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:14:06,202 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i [2021-12-06 17:14:06,219 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data/7f81fcdad/c301d21464174ad7808532d4bf688c4a/FLAGf8c1b8c1d [2021-12-06 17:14:06,727 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/data/7f81fcdad/c301d21464174ad7808532d4bf688c4a [2021-12-06 17:14:06,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:14:06,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:14:06,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:14:06,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:14:06,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:14:06,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:06" (1/1) ... [2021-12-06 17:14:06,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e497081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:06, skipping insertion in model container [2021-12-06 17:14:06,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:06" (1/1) ... [2021-12-06 17:14:06,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:14:06,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:14:07,048 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_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[33021,33034] [2021-12-06 17:14:07,149 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_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[49681,49694] [2021-12-06 17:14:07,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:14:07,172 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-06 17:14:07,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:14:07,197 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_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[33021,33034] [2021-12-06 17:14:07,257 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_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[49681,49694] [2021-12-06 17:14:07,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:14:07,273 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:14:07,293 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_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[33021,33034] [2021-12-06 17:14:07,335 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_b6755c33-a115-48e6-8695-507f9acccdfd/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-2.i[49681,49694] [2021-12-06 17:14:07,340 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:14:07,368 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:14:07,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07 WrapperNode [2021-12-06 17:14:07,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:14:07,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:14:07,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:14:07,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:14:07,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,463 INFO L137 Inliner]: procedures = 180, calls = 439, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1578 [2021-12-06 17:14:07,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:14:07,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:14:07,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:14:07,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:14:07,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:14:07,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:14:07,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:14:07,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:14:07,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (1/1) ... [2021-12-06 17:14:07,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:14:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:14:07,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:14:07,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:14:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-06 17:14:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 17:14:07,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-06 17:14:07,630 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 17:14:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:14:07,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:14:07,821 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:14:07,822 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:14:07,825 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-06 17:14:12,589 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:14:12,602 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:14:12,602 INFO L301 CfgBuilder]: Removed 92 assume(true) statements. [2021-12-06 17:14:12,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:12 BoogieIcfgContainer [2021-12-06 17:14:12,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:14:12,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:14:12,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:14:12,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:14:12,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:14:06" (1/3) ... [2021-12-06 17:14:12,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b19e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:12, skipping insertion in model container [2021-12-06 17:14:12,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:07" (2/3) ... [2021-12-06 17:14:12,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b19e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:12, skipping insertion in model container [2021-12-06 17:14:12,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:12" (3/3) ... [2021-12-06 17:14:12,610 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-2.i [2021-12-06 17:14:12,614 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:14:12,614 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 834 error locations. [2021-12-06 17:14:12,645 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:14:12,650 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 17:14:12,650 INFO L340 AbstractCegarLoop]: Starting to check reachability of 834 error locations. [2021-12-06 17:14:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 1655 states, 813 states have (on average 2.2484624846248464) internal successors, (1828), 1646 states have internal predecessors, (1828), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 17:14:12,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:12,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 17:14:12,686 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2021-12-06 17:14:12,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:12,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045829304] [2021-12-06 17:14:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:12,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:12,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:12,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:12,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 17:14:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:12,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-06 17:14:12,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:12,819 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 17:14:12,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:12,820 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:12,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045829304] [2021-12-06 17:14:12,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045829304] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:12,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:12,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:14:12,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773855875] [2021-12-06 17:14:12,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:12,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 17:14:12,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:12,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 17:14:12,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 17:14:12,850 INFO L87 Difference]: Start difference. First operand has 1655 states, 813 states have (on average 2.2484624846248464) internal successors, (1828), 1646 states have internal predecessors, (1828), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:12,945 INFO L93 Difference]: Finished difference Result 1637 states and 1731 transitions. [2021-12-06 17:14:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 17:14:12,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 17:14:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:12,967 INFO L225 Difference]: With dead ends: 1637 [2021-12-06 17:14:12,968 INFO L226 Difference]: Without dead ends: 1635 [2021-12-06 17:14:12,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 17:14:12,971 INFO L933 BasicCegarLoop]: 1731 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:12,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:14:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2021-12-06 17:14:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2021-12-06 17:14:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 804 states have (on average 2.123134328358209) internal successors, (1707), 1626 states have internal predecessors, (1707), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1729 transitions. [2021-12-06 17:14:13,054 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1729 transitions. Word has length 5 [2021-12-06 17:14:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:13,054 INFO L470 AbstractCegarLoop]: Abstraction has 1635 states and 1729 transitions. [2021-12-06 17:14:13,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1729 transitions. [2021-12-06 17:14:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 17:14:13,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:13,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 17:14:13,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:14:13,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:13,256 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:13,258 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2021-12-06 17:14:13,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:13,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596642474] [2021-12-06 17:14:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:13,260 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:13,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:13,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:13,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 17:14:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:13,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:14:13,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:13,472 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 17:14:13,481 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 17:14:13,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:13,482 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596642474] [2021-12-06 17:14:13,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596642474] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:13,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:13,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:14:13,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568166235] [2021-12-06 17:14:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:13,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:14:13,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:13,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:14:13,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:13,484 INFO L87 Difference]: Start difference. First operand 1635 states and 1729 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:15,797 INFO L93 Difference]: Finished difference Result 1891 states and 2028 transitions. [2021-12-06 17:14:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:14:15,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 17:14:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:15,805 INFO L225 Difference]: With dead ends: 1891 [2021-12-06 17:14:15,805 INFO L226 Difference]: Without dead ends: 1891 [2021-12-06 17:14:15,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:15,806 INFO L933 BasicCegarLoop]: 1168 mSDtfsCounter, 1369 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:15,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1380 Valid, 1533 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-06 17:14:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2021-12-06 17:14:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1620. [2021-12-06 17:14:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 880 states have (on average 1.9897727272727272) internal successors, (1751), 1611 states have internal predecessors, (1751), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1773 transitions. [2021-12-06 17:14:15,843 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1773 transitions. Word has length 5 [2021-12-06 17:14:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:15,843 INFO L470 AbstractCegarLoop]: Abstraction has 1620 states and 1773 transitions. [2021-12-06 17:14:15,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1773 transitions. [2021-12-06 17:14:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 17:14:15,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:15,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 17:14:15,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-06 17:14:16,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:16,044 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2021-12-06 17:14:16,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:16,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921941927] [2021-12-06 17:14:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:16,046 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:16,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:16,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 17:14:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:16,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:14:16,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:16,127 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 17:14:16,140 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 17:14:16,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:16,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:16,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921941927] [2021-12-06 17:14:16,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921941927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:16,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:16,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:14:16,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609911471] [2021-12-06 17:14:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:16,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:14:16,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:16,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:14:16,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:16,146 INFO L87 Difference]: Start difference. First operand 1620 states and 1773 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:19,525 INFO L93 Difference]: Finished difference Result 2140 states and 2343 transitions. [2021-12-06 17:14:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:14:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 17:14:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:19,534 INFO L225 Difference]: With dead ends: 2140 [2021-12-06 17:14:19,534 INFO L226 Difference]: Without dead ends: 2140 [2021-12-06 17:14:19,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:19,535 INFO L933 BasicCegarLoop]: 1560 mSDtfsCounter, 741 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:19,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 2268 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-12-06 17:14:19,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2021-12-06 17:14:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1776. [2021-12-06 17:14:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1046 states have (on average 1.9665391969407267) internal successors, (2057), 1767 states have internal predecessors, (2057), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2079 transitions. [2021-12-06 17:14:19,571 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2079 transitions. Word has length 5 [2021-12-06 17:14:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:19,571 INFO L470 AbstractCegarLoop]: Abstraction has 1776 states and 2079 transitions. [2021-12-06 17:14:19,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2079 transitions. [2021-12-06 17:14:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 17:14:19,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:19,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 17:14:19,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-06 17:14:19,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:19,773 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2021-12-06 17:14:19,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:19,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006283071] [2021-12-06 17:14:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:19,774 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:19,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:19,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:19,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 17:14:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:19,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:14:19,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:19,854 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 17:14:19,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:19,855 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:19,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006283071] [2021-12-06 17:14:19,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006283071] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:19,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:19,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:14:19,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886039123] [2021-12-06 17:14:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:19,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:14:19,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:19,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:14:19,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:19,856 INFO L87 Difference]: Start difference. First operand 1776 states and 2079 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:19,968 INFO L93 Difference]: Finished difference Result 3336 states and 3931 transitions. [2021-12-06 17:14:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:14:19,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-06 17:14:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:19,986 INFO L225 Difference]: With dead ends: 3336 [2021-12-06 17:14:19,986 INFO L226 Difference]: Without dead ends: 3336 [2021-12-06 17:14:19,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:19,988 INFO L933 BasicCegarLoop]: 1854 mSDtfsCounter, 1377 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:19,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1388 Valid, 3471 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:14:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-12-06 17:14:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 1778. [2021-12-06 17:14:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1048 states have (on average 1.9646946564885497) internal successors, (2059), 1769 states have internal predecessors, (2059), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2081 transitions. [2021-12-06 17:14:20,041 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2081 transitions. Word has length 6 [2021-12-06 17:14:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:20,042 INFO L470 AbstractCegarLoop]: Abstraction has 1778 states and 2081 transitions. [2021-12-06 17:14:20,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2081 transitions. [2021-12-06 17:14:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 17:14:20,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:20,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:20,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 17:14:20,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:20,244 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2021-12-06 17:14:20,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:20,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159306700] [2021-12-06 17:14:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:20,248 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:20,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:20,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:20,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 17:14:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:20,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:14:20,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:20,460 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 17:14:20,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:20,460 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:20,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159306700] [2021-12-06 17:14:20,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159306700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:20,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:20,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:14:20,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081883996] [2021-12-06 17:14:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:20,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:14:20,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:14:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:20,461 INFO L87 Difference]: Start difference. First operand 1778 states and 2081 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 17:14:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:20,487 INFO L93 Difference]: Finished difference Result 1742 states and 2044 transitions. [2021-12-06 17:14:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:14:20,488 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 17:14:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:20,494 INFO L225 Difference]: With dead ends: 1742 [2021-12-06 17:14:20,494 INFO L226 Difference]: Without dead ends: 1742 [2021-12-06 17:14:20,494 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 17:14:20,495 INFO L933 BasicCegarLoop]: 1580 mSDtfsCounter, 1550 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1608 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 17:14:20,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1561 Valid, 1608 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:14:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2021-12-06 17:14:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1736. [2021-12-06 17:14:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1030 states have (on average 1.9572815533980583) internal successors, (2016), 1727 states have internal predecessors, (2016), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2038 transitions. [2021-12-06 17:14:20,521 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2038 transitions. Word has length 11 [2021-12-06 17:14:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:20,522 INFO L470 AbstractCegarLoop]: Abstraction has 1736 states and 2038 transitions. [2021-12-06 17:14:20,522 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 17:14:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2038 transitions. [2021-12-06 17:14:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 17:14:20,522 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:20,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:20,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 17:14:20,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:20,723 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2021-12-06 17:14:20,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:20,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30218204] [2021-12-06 17:14:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:20,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:20,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:20,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:20,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 17:14:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:20,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:14:20,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:20,887 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 17:14:20,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:20,888 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:20,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30218204] [2021-12-06 17:14:20,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30218204] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:20,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:20,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:14:20,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373603719] [2021-12-06 17:14:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:20,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:14:20,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:14:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:14:20,889 INFO L87 Difference]: Start difference. First operand 1736 states and 2038 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 17:14:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:20,944 INFO L93 Difference]: Finished difference Result 1721 states and 2016 transitions. [2021-12-06 17:14:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:14:20,945 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 17:14:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:20,951 INFO L225 Difference]: With dead ends: 1721 [2021-12-06 17:14:20,951 INFO L226 Difference]: Without dead ends: 1721 [2021-12-06 17:14:20,951 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 17:14:20,952 INFO L933 BasicCegarLoop]: 1535 mSDtfsCounter, 1521 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3091 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 17:14:20,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1532 Valid, 3091 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:14:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2021-12-06 17:14:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1714. [2021-12-06 17:14:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1022 states have (on average 1.9442270058708415) internal successors, (1987), 1705 states have internal predecessors, (1987), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2009 transitions. [2021-12-06 17:14:20,976 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2009 transitions. Word has length 13 [2021-12-06 17:14:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:20,976 INFO L470 AbstractCegarLoop]: Abstraction has 1714 states and 2009 transitions. [2021-12-06 17:14:20,976 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 17:14:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2009 transitions. [2021-12-06 17:14:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 17:14:20,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:20,977 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 17:14:20,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-06 17:14:21,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:21,178 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2021-12-06 17:14:21,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:21,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39136534] [2021-12-06 17:14:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:21,180 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:21,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:21,181 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:21,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 17:14:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:21,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:14:21,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:21,410 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 17:14:21,455 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 17:14:21,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:21,456 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:21,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39136534] [2021-12-06 17:14:21,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39136534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:21,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:21,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:14:21,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176900098] [2021-12-06 17:14:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:21,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:14:21,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:14:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:14:21,458 INFO L87 Difference]: Start difference. First operand 1714 states and 2009 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 17:14:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:24,903 INFO L93 Difference]: Finished difference Result 2759 states and 3092 transitions. [2021-12-06 17:14:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:14:24,903 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 17:14:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:24,913 INFO L225 Difference]: With dead ends: 2759 [2021-12-06 17:14:24,913 INFO L226 Difference]: Without dead ends: 2759 [2021-12-06 17:14:24,913 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 17:14:24,914 INFO L933 BasicCegarLoop]: 800 mSDtfsCounter, 3206 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3214 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:24,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3214 Valid, 1886 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-06 17:14:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2021-12-06 17:14:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1710. [2021-12-06 17:14:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1022 states have (on average 1.9403131115459882) internal successors, (1983), 1701 states have internal predecessors, (1983), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2005 transitions. [2021-12-06 17:14:24,946 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2005 transitions. Word has length 27 [2021-12-06 17:14:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:24,946 INFO L470 AbstractCegarLoop]: Abstraction has 1710 states and 2005 transitions. [2021-12-06 17:14:24,946 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 17:14:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2005 transitions. [2021-12-06 17:14:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 17:14:24,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:24,947 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 17:14:24,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-06 17:14:25,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:25,148 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2021-12-06 17:14:25,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:25,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578369755] [2021-12-06 17:14:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:25,151 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:25,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:25,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:25,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-06 17:14:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:25,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:14:25,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:25,360 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 17:14:25,478 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 17:14:25,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:25,479 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:25,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578369755] [2021-12-06 17:14:25,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578369755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:25,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:25,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:14:25,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980407025] [2021-12-06 17:14:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:25,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:14:25,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:25,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:14:25,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:14:25,480 INFO L87 Difference]: Start difference. First operand 1710 states and 2005 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 17:14:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:30,016 INFO L93 Difference]: Finished difference Result 2278 states and 2483 transitions. [2021-12-06 17:14:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:14:30,016 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 17:14:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:30,024 INFO L225 Difference]: With dead ends: 2278 [2021-12-06 17:14:30,024 INFO L226 Difference]: Without dead ends: 2278 [2021-12-06 17:14:30,024 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 17:14:30,024 INFO L933 BasicCegarLoop]: 1178 mSDtfsCounter, 1501 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:30,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1501 Valid, 2603 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2021-12-06 17:14:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2021-12-06 17:14:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1706. [2021-12-06 17:14:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1022 states have (on average 1.936399217221135) internal successors, (1979), 1697 states have internal predecessors, (1979), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2001 transitions. [2021-12-06 17:14:30,048 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2001 transitions. Word has length 27 [2021-12-06 17:14:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:30,048 INFO L470 AbstractCegarLoop]: Abstraction has 1706 states and 2001 transitions. [2021-12-06 17:14:30,048 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 17:14:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2001 transitions. [2021-12-06 17:14:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 17:14:30,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:30,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:30,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-06 17:14:30,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:30,251 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2021-12-06 17:14:30,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:30,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31756093] [2021-12-06 17:14:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:30,255 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:30,257 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:30,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-06 17:14:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:30,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:14:30,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:30,579 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 17:14:30,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:30,579 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:30,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31756093] [2021-12-06 17:14:30,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31756093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:30,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:30,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:14:30,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856334070] [2021-12-06 17:14:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:30,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:14:30,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:14:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:14:30,580 INFO L87 Difference]: Start difference. First operand 1706 states and 2001 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:30,615 INFO L93 Difference]: Finished difference Result 1706 states and 1997 transitions. [2021-12-06 17:14:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:14:30,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-06 17:14:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:30,621 INFO L225 Difference]: With dead ends: 1706 [2021-12-06 17:14:30,621 INFO L226 Difference]: Without dead ends: 1706 [2021-12-06 17:14:30,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:14:30,622 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 1497 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 3069 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 17:14:30,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1508 Valid, 3069 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:14:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2021-12-06 17:14:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1700. [2021-12-06 17:14:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1016 states have (on average 1.937992125984252) internal successors, (1969), 1691 states have internal predecessors, (1969), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 1991 transitions. [2021-12-06 17:14:30,642 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 1991 transitions. Word has length 42 [2021-12-06 17:14:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:30,642 INFO L470 AbstractCegarLoop]: Abstraction has 1700 states and 1991 transitions. [2021-12-06 17:14:30,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 1991 transitions. [2021-12-06 17:14:30,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-06 17:14:30,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:30,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:30,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-06 17:14:30,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:30,845 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:30,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2021-12-06 17:14:30,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:30,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959472674] [2021-12-06 17:14:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:30,848 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:30,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:30,851 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:30,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-06 17:14:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:31,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:14:31,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:31,238 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 17:14:31,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:31,239 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959472674] [2021-12-06 17:14:31,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959472674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:31,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:31,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:14:31,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257775941] [2021-12-06 17:14:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:31,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:14:31,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:14:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:31,240 INFO L87 Difference]: Start difference. First operand 1700 states and 1991 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:31,403 INFO L93 Difference]: Finished difference Result 1941 states and 2241 transitions. [2021-12-06 17:14:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:14:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-12-06 17:14:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:31,411 INFO L225 Difference]: With dead ends: 1941 [2021-12-06 17:14:31,411 INFO L226 Difference]: Without dead ends: 1941 [2021-12-06 17:14:31,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:14:31,412 INFO L933 BasicCegarLoop]: 1608 mSDtfsCounter, 269 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:31,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 3012 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:14:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2021-12-06 17:14:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1746. [2021-12-06 17:14:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1062 states have (on average 1.8973634651600753) internal successors, (2015), 1737 states have internal predecessors, (2015), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2037 transitions. [2021-12-06 17:14:31,431 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2037 transitions. Word has length 50 [2021-12-06 17:14:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:31,431 INFO L470 AbstractCegarLoop]: Abstraction has 1746 states and 2037 transitions. [2021-12-06 17:14:31,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2037 transitions. [2021-12-06 17:14:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-06 17:14:31,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:31,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:31,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-06 17:14:31,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:31,634 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2021-12-06 17:14:31,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:31,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259280301] [2021-12-06 17:14:31,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:31,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:31,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:31,640 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:31,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-06 17:14:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:31,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 17:14:31,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:31,906 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 17:14:31,910 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 17:14:32,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:14:32,197 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 17:14:32,205 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:14:32,206 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 18 treesize of output 18 [2021-12-06 17:14:32,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 17:14:32,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:32,218 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:32,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259280301] [2021-12-06 17:14:32,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259280301] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:32,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:32,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:14:32,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690943024] [2021-12-06 17:14:32,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:32,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:14:32,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:14:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:14:32,219 INFO L87 Difference]: Start difference. First operand 1746 states and 2037 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:35,277 INFO L93 Difference]: Finished difference Result 1933 states and 2208 transitions. [2021-12-06 17:14:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:14:35,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-12-06 17:14:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:35,285 INFO L225 Difference]: With dead ends: 1933 [2021-12-06 17:14:35,285 INFO L226 Difference]: Without dead ends: 1933 [2021-12-06 17:14:35,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:14:35,285 INFO L933 BasicCegarLoop]: 631 mSDtfsCounter, 1569 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:35,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1585 Valid, 984 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-12-06 17:14:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2021-12-06 17:14:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1496. [2021-12-06 17:14:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 896 states have (on average 1.8013392857142858) internal successors, (1614), 1487 states have internal predecessors, (1614), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1636 transitions. [2021-12-06 17:14:35,302 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1636 transitions. Word has length 53 [2021-12-06 17:14:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:35,302 INFO L470 AbstractCegarLoop]: Abstraction has 1496 states and 1636 transitions. [2021-12-06 17:14:35,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1636 transitions. [2021-12-06 17:14:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:14:35,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:35,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:35,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-06 17:14:35,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:35,505 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2021-12-06 17:14:35,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:35,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42713294] [2021-12-06 17:14:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:35,508 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:35,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:35,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:35,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-06 17:14:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:35,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:14:35,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:35,858 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 17:14:35,872 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 17:14:35,894 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 17:14:35,902 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 17:14:35,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:35,902 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:35,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42713294] [2021-12-06 17:14:35,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42713294] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:35,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:35,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:14:35,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715059805] [2021-12-06 17:14:35,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:35,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:14:35,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:35,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:14:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:14:35,904 INFO L87 Difference]: Start difference. First operand 1496 states and 1636 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:39,123 INFO L93 Difference]: Finished difference Result 1495 states and 1635 transitions. [2021-12-06 17:14:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:14:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-06 17:14:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:39,129 INFO L225 Difference]: With dead ends: 1495 [2021-12-06 17:14:39,129 INFO L226 Difference]: Without dead ends: 1495 [2021-12-06 17:14:39,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:14:39,130 INFO L933 BasicCegarLoop]: 1449 mSDtfsCounter, 4 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3704 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:39,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3704 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-12-06 17:14:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2021-12-06 17:14:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2021-12-06 17:14:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 896 states have (on average 1.8002232142857142) internal successors, (1613), 1486 states have internal predecessors, (1613), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1635 transitions. [2021-12-06 17:14:39,145 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1635 transitions. Word has length 58 [2021-12-06 17:14:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:39,146 INFO L470 AbstractCegarLoop]: Abstraction has 1495 states and 1635 transitions. [2021-12-06 17:14:39,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1635 transitions. [2021-12-06 17:14:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-06 17:14:39,146 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:39,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:39,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-06 17:14:39,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:39,347 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2021-12-06 17:14:39,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:39,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586705153] [2021-12-06 17:14:39,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:39,349 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:39,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:39,350 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:39,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-06 17:14:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:39,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 17:14:39,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:39,576 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 17:14:39,591 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 17:14:39,598 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 17:14:39,638 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 17:14:39,641 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 17:14:39,653 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 17:14:39,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:39,653 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:39,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586705153] [2021-12-06 17:14:39,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586705153] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:39,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:39,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:14:39,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869112185] [2021-12-06 17:14:39,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:39,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:14:39,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:39,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:14:39,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:14:39,655 INFO L87 Difference]: Start difference. First operand 1495 states and 1635 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:43,922 INFO L93 Difference]: Finished difference Result 1494 states and 1634 transitions. [2021-12-06 17:14:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:14:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-06 17:14:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:43,927 INFO L225 Difference]: With dead ends: 1494 [2021-12-06 17:14:43,927 INFO L226 Difference]: Without dead ends: 1494 [2021-12-06 17:14:43,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:14:43,928 INFO L933 BasicCegarLoop]: 1449 mSDtfsCounter, 2 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3750 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:43,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 3750 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2021-12-06 17:14:43,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2021-12-06 17:14:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2021-12-06 17:14:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 895 states have (on average 1.8011173184357543) internal successors, (1612), 1485 states have internal predecessors, (1612), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-06 17:14:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1634 transitions. [2021-12-06 17:14:43,945 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1634 transitions. Word has length 58 [2021-12-06 17:14:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:43,946 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 1634 transitions. [2021-12-06 17:14:43,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1634 transitions. [2021-12-06 17:14:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 17:14:43,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:43,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:43,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-06 17:14:44,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:44,148 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2015085822, now seen corresponding path program 1 times [2021-12-06 17:14:44,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:44,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789602908] [2021-12-06 17:14:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:44,153 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:44,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:44,155 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:44,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-06 17:14:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:44,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:14:44,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:44,414 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 17:14:44,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:44,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:44,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789602908] [2021-12-06 17:14:44,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789602908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:44,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:44,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:14:44,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288003885] [2021-12-06 17:14:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:44,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:14:44,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:14:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:14:44,415 INFO L87 Difference]: Start difference. First operand 1494 states and 1634 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 17:14:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:44,457 INFO L93 Difference]: Finished difference Result 1497 states and 1639 transitions. [2021-12-06 17:14:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:14:44,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-12-06 17:14:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:44,462 INFO L225 Difference]: With dead ends: 1497 [2021-12-06 17:14:44,462 INFO L226 Difference]: Without dead ends: 1497 [2021-12-06 17:14:44,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:14:44,463 INFO L933 BasicCegarLoop]: 1448 mSDtfsCounter, 2 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4336 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 17:14:44,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4336 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:14:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-12-06 17:14:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2021-12-06 17:14:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 897 states have (on average 1.8004459308807135) internal successors, (1615), 1488 states have internal predecessors, (1615), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-06 17:14:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1639 transitions. [2021-12-06 17:14:44,481 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1639 transitions. Word has length 66 [2021-12-06 17:14:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:44,481 INFO L470 AbstractCegarLoop]: Abstraction has 1497 states and 1639 transitions. [2021-12-06 17:14:44,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 17:14:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1639 transitions. [2021-12-06 17:14:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:14:44,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:44,482 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 17:14:44,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-06 17:14:44,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:44,683 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1745990217, now seen corresponding path program 1 times [2021-12-06 17:14:44,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:44,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244942877] [2021-12-06 17:14:44,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:44,687 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:44,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:44,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-06 17:14:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:44,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:14:44,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:44,936 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 17:14:44,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:14:45,020 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 17:14:45,020 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244942877] [2021-12-06 17:14:45,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244942877] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:14:45,021 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:14:45,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-06 17:14:45,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113518185] [2021-12-06 17:14:45,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:14:45,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:14:45,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:45,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:14:45,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:14:45,022 INFO L87 Difference]: Start difference. First operand 1497 states and 1639 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:14:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:45,171 INFO L93 Difference]: Finished difference Result 1509 states and 1657 transitions. [2021-12-06 17:14:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:14:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2021-12-06 17:14:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:45,175 INFO L225 Difference]: With dead ends: 1509 [2021-12-06 17:14:45,175 INFO L226 Difference]: Without dead ends: 1509 [2021-12-06 17:14:45,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-12-06 17:14:45,176 INFO L933 BasicCegarLoop]: 1448 mSDtfsCounter, 20 mSDsluCounter, 4327 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5775 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:45,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 5775 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:14:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2021-12-06 17:14:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1507. [2021-12-06 17:14:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 906 states have (on average 1.7991169977924946) internal successors, (1630), 1497 states have internal predecessors, (1630), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-06 17:14:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1654 transitions. [2021-12-06 17:14:45,196 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1654 transitions. Word has length 67 [2021-12-06 17:14:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:45,197 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 1654 transitions. [2021-12-06 17:14:45,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:14:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1654 transitions. [2021-12-06 17:14:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-06 17:14:45,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:45,197 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:45,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-06 17:14:45,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:45,399 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 483699518, now seen corresponding path program 2 times [2021-12-06 17:14:45,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:45,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729866619] [2021-12-06 17:14:45,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:14:45,403 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:45,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:45,405 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:45,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-06 17:14:45,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:14:45,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:14:45,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:14:45,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:45,916 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 17:14:45,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:14:46,077 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 17:14:46,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:46,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729866619] [2021-12-06 17:14:46,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729866619] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:14:46,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:14:46,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-06 17:14:46,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737633699] [2021-12-06 17:14:46,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:14:46,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 17:14:46,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:46,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 17:14:46,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-06 17:14:46,078 INFO L87 Difference]: Start difference. First operand 1507 states and 1654 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:14:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:46,682 INFO L93 Difference]: Finished difference Result 1528 states and 1686 transitions. [2021-12-06 17:14:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:14:46,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2021-12-06 17:14:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:46,686 INFO L225 Difference]: With dead ends: 1528 [2021-12-06 17:14:46,686 INFO L226 Difference]: Without dead ends: 1524 [2021-12-06 17:14:46,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2021-12-06 17:14:46,687 INFO L933 BasicCegarLoop]: 1451 mSDtfsCounter, 43 mSDsluCounter, 12993 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 14444 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:46,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 14444 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:14:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2021-12-06 17:14:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1516. [2021-12-06 17:14:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 915 states have (on average 1.794535519125683) internal successors, (1642), 1506 states have internal predecessors, (1642), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-06 17:14:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1666 transitions. [2021-12-06 17:14:46,704 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1666 transitions. Word has length 70 [2021-12-06 17:14:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:46,704 INFO L470 AbstractCegarLoop]: Abstraction has 1516 states and 1666 transitions. [2021-12-06 17:14:46,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:14:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1666 transitions. [2021-12-06 17:14:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-06 17:14:46,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:46,705 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] [2021-12-06 17:14:46,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-06 17:14:46,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:46,906 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash 436758686, now seen corresponding path program 3 times [2021-12-06 17:14:46,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:46,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852715942] [2021-12-06 17:14:46,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 17:14:46,910 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:46,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:46,912 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:46,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-06 17:14:47,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-06 17:14:47,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:14:47,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 17:14:47,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:47,737 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 17:14:47,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:14:48,381 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 17:14:48,381 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:48,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852715942] [2021-12-06 17:14:48,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852715942] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:14:48,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:14:48,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-06 17:14:48,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416767947] [2021-12-06 17:14:48,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:14:48,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 17:14:48,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 17:14:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-06 17:14:48,382 INFO L87 Difference]: Start difference. First operand 1516 states and 1666 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:14:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:51,600 INFO L93 Difference]: Finished difference Result 1558 states and 1742 transitions. [2021-12-06 17:14:51,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 17:14:51,601 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2021-12-06 17:14:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:51,604 INFO L225 Difference]: With dead ends: 1558 [2021-12-06 17:14:51,604 INFO L226 Difference]: Without dead ends: 1552 [2021-12-06 17:14:51,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2021-12-06 17:14:51,605 INFO L933 BasicCegarLoop]: 1455 mSDtfsCounter, 138 mSDsluCounter, 17387 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 18842 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:14:51,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 18842 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-06 17:14:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2021-12-06 17:14:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1534. [2021-12-06 17:14:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 933 states have (on average 1.7845659163987138) internal successors, (1665), 1524 states have internal predecessors, (1665), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-06 17:14:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 1689 transitions. [2021-12-06 17:14:51,624 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 1689 transitions. Word has length 76 [2021-12-06 17:14:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:51,624 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 1689 transitions. [2021-12-06 17:14:51,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:14:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1689 transitions. [2021-12-06 17:14:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-06 17:14:51,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:51,625 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] [2021-12-06 17:14:51,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-06 17:14:51,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:51,827 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:14:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -357348514, now seen corresponding path program 4 times [2021-12-06 17:14:51,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:51,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450316374] [2021-12-06 17:14:51,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 17:14:51,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:51,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:51,833 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:51,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-06 17:14:52,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 17:14:52,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:14:52,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-06 17:14:52,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:52,374 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 17:14:52,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:14:53,926 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 17:14:53,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:53,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450316374] [2021-12-06 17:14:53,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450316374] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:14:53,927 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:14:53,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-06 17:14:53,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819261996] [2021-12-06 17:14:53,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:14:53,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 17:14:53,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:53,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 17:14:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 17:14:53,930 INFO L87 Difference]: Start difference. First operand 1534 states and 1689 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:15:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:15:06,395 INFO L93 Difference]: Finished difference Result 1614 states and 1822 transitions. [2021-12-06 17:15:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-06 17:15:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2021-12-06 17:15:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:15:06,398 INFO L225 Difference]: With dead ends: 1614 [2021-12-06 17:15:06,398 INFO L226 Difference]: Without dead ends: 1610 [2021-12-06 17:15:06,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-06 17:15:06,402 INFO L933 BasicCegarLoop]: 1468 mSDtfsCounter, 409 mSDsluCounter, 39413 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 40881 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:15:06,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 40881 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-06 17:15:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2021-12-06 17:15:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1568. [2021-12-06 17:15:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 967 states have (on average 1.7693898655635987) internal successors, (1711), 1558 states have internal predecessors, (1711), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-06 17:15:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1735 transitions. [2021-12-06 17:15:06,427 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1735 transitions. Word has length 88 [2021-12-06 17:15:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:15:06,428 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 1735 transitions. [2021-12-06 17:15:06,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:15:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1735 transitions. [2021-12-06 17:15:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-06 17:15:06,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:15:06,429 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] [2021-12-06 17:15:06,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-06 17:15:06,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:15:06,630 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:15:06,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:15:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash 182176190, now seen corresponding path program 5 times [2021-12-06 17:15:06,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:15:06,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709168403] [2021-12-06 17:15:06,633 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 17:15:06,634 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:15:06,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:15:06,635 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:15:06,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-06 17:15:07,841 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-06 17:15:07,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:15:07,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-06 17:15:07,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:15:07,896 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 17:15:07,995 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:15:07,995 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 27 treesize of output 34 [2021-12-06 17:15:08,031 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 17:15:08,151 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 17:15:09,033 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_1616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1616) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:15:10,258 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:15:10,258 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 17:15:10,299 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 17:15:10,336 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 17:15:10,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:15:10,545 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))))) is different from false [2021-12-06 17:15:10,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:15:10,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709168403] [2021-12-06 17:15:10,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709168403] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:15:10,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1369971868] [2021-12-06 17:15:10,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 17:15:10,547 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 17:15:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 17:15:10,548 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 17:15:10,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-12-06 17:16:20,757 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-06 17:16:20,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:16:20,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-06 17:16:20,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:16:20,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 17:16:21,085 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:16:21,085 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 17:16:21,112 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 17:16:21,174 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 17:16:21,319 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2049) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:21,792 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2061) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:22,729 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2084) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:22,754 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2085 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2085) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:23,072 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:16:23,072 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 17:16:23,119 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 17:16:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2021-12-06 17:16:23,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:16:23,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1369971868] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:16:23,352 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:16:23,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 13 [2021-12-06 17:16:23,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798511537] [2021-12-06 17:16:23,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:16:23,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 17:16:23,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:16:23,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 17:16:23,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=98, Unknown=17, NotChecked=150, Total=306 [2021-12-06 17:16:23,353 INFO L87 Difference]: Start difference. First operand 1568 states and 1735 transitions. Second operand has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 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 17:16:23,444 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1600) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_7 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (let ((.cse0 (bvneg v_arrayElimCell_7))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| v_arrayElimCell_9)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg .cse0)))) (_ bv1 1))) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|))))) (exists ((v_ArrVal_2049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2061 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2061) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1616) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:16:25,309 INFO L93 Difference]: Finished difference Result 1892 states and 2047 transitions. [2021-12-06 17:16:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:16:25,309 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-12-06 17:16:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:16:25,313 INFO L225 Difference]: With dead ends: 1892 [2021-12-06 17:16:25,313 INFO L226 Difference]: Without dead ends: 1888 [2021-12-06 17:16:25,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 123 SyntacticMatches, 88 SemanticMatches, 17 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=43, Invalid=99, Unknown=18, NotChecked=182, Total=342 [2021-12-06 17:16:25,313 INFO L933 BasicCegarLoop]: 872 mSDtfsCounter, 1131 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 14376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13523 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-06 17:16:25,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 4289 Invalid, 14376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 841 Invalid, 0 Unknown, 13523 Unchecked, 1.9s Time] [2021-12-06 17:16:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2021-12-06 17:16:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1616. [2021-12-06 17:16:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1015 states have (on average 1.7330049261083744) internal successors, (1759), 1605 states have internal predecessors, (1759), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-06 17:16:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1783 transitions. [2021-12-06 17:16:25,335 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1783 transitions. Word has length 110 [2021-12-06 17:16:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:16:25,335 INFO L470 AbstractCegarLoop]: Abstraction has 1616 states and 1783 transitions. [2021-12-06 17:16:25,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 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 17:16:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1783 transitions. [2021-12-06 17:16:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-06 17:16:25,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:16:25,336 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] [2021-12-06 17:16:25,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-06 17:16:25,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2021-12-06 17:16:25,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 17:16:25,738 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 830 more)] === [2021-12-06 17:16:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:16:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 182176191, now seen corresponding path program 1 times [2021-12-06 17:16:25,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:16:25,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626639607] [2021-12-06 17:16:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:16:25,742 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:16:25,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:16:25,743 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:16:25,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-06 17:16:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:16:26,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-06 17:16:26,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:16:26,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:16:26,447 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 17:16:26,454 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:16:26,455 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 17:16:26,469 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 17:16:26,474 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 17:16:26,551 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 17:16:26,554 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 17:16:26,593 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,656 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,664 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:16:26,673 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32)))) is different from true [2021-12-06 17:16:26,681 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:16:26,690 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,699 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515)))) is different from true [2021-12-06 17:16:26,749 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,758 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:16:26,766 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525)))) is different from true [2021-12-06 17:16:26,775 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,784 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:16:26,792 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,821 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534)))) is different from true [2021-12-06 17:16:26,830 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2021-12-06 17:16:26,839 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539)))) is different from true [2021-12-06 17:16:26,847 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540)))) is different from true [2021-12-06 17:16:26,882 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:16:26,935 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:16:26,945 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,954 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555)))) is different from true [2021-12-06 17:16:26,962 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,971 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558)))) is different from true [2021-12-06 17:16:26,980 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560)))) is different from true [2021-12-06 17:16:26,989 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:26,999 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2564))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:27,009 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567)))) is different from true [2021-12-06 17:16:27,017 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:27,025 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571)))) is different from true [2021-12-06 17:16:27,034 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:27,043 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2574))) (exists ((v_ArrVal_2575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2575) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:27,053 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2577) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2576) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:27,062 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:16:27,071 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2581) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:16:27,080 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583)))) is different from true [2021-12-06 17:16:27,089 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:16:27,120 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:16:27,120 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 17:16:27,125 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 17:16:27,155 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 17:16:27,158 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 17:16:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2021-12-06 17:16:27,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:16:27,824 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (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~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-06 17:16:27,830 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:16:27,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626639607] [2021-12-06 17:16:27,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626639607] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:16:27,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1754342199] [2021-12-06 17:16:27,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:16:27,830 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 17:16:27,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 17:16:27,831 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 17:16:27,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6755c33-a115-48e6-8695-507f9acccdfd/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-12-06 17:18:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:16,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-06 17:18:16,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:16,722 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 17:18:16,817 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:18:16,817 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 17:18:16,823 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 17:18:16,832 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 17:18:16,840 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 17:18:16,885 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 17:18:16,888 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 17:18:16,927 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:16,961 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:16,970 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044)))) is different from true [2021-12-06 17:18:16,978 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:16,988 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:16,998 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,007 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,017 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,026 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056)))) is different from true [2021-12-06 17:18:17,038 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3058) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,048 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3061))) (exists ((v_ArrVal_3060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3060)))) is different from true [2021-12-06 17:18:17,057 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3062) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3063) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,066 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3064) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3065)))) is different from true [2021-12-06 17:18:17,096 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32)))) is different from true [2021-12-06 17:18:17,105 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070)))) is different from true [2021-12-06 17:18:17,113 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,122 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074)))) is different from true [2021-12-06 17:18:17,154 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078)))) is different from true [2021-12-06 17:18:17,163 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,172 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,181 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,190 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,198 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3088 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3088) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,207 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091)))) is different from true [2021-12-06 17:18:17,216 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3093) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3092) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,225 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3094 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3094) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3095 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3095) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,233 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3097) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3096 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3096)))) is different from true [2021-12-06 17:18:17,243 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3099 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3099) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3098 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3098) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,251 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3101 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3101) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3100) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,260 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3103 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3103) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3102) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,269 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3105))) (exists ((v_ArrVal_3104 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3104) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,278 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3106) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3107 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3107)))) is different from true [2021-12-06 17:18:17,287 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3109) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3108) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,297 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3110))) (exists ((v_ArrVal_3111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3111) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,306 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3112 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3112))) (exists ((v_ArrVal_3113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3113) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,315 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3114))) (exists ((v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3115) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,325 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3116) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3117 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3117)))) is different from true [2021-12-06 17:18:17,334 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3118) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:17,342 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3121))) (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 17:18:17,356 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3123 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3123))) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3122 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3122) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,365 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3125 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3124 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3124) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:17,398 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:17,399 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 17:18:17,403 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 17:18:17,437 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 17:18:17,441 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 17:18:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2021-12-06 17:18:17,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:18:18,003 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3216 (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~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3216 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3216) |c_ULTIMATE.start_main_~user~0#1.base|) (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 17:18:18,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1754342199] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:18:18,008 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:18:18,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 49] total 85 [2021-12-06 17:18:18,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686120636] [2021-12-06 17:18:18,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:18:18,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2021-12-06 17:18:18,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:18,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-12-06 17:18:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=160, Unknown=85, NotChecked=7584, Total=8010 [2021-12-06 17:18:18,013 INFO L87 Difference]: Start difference. First operand 1616 states and 1783 transitions. Second operand has 86 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 86 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 17:18:18,339 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3038) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3039) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.base|))) is different from true [2021-12-06 17:18:18,343 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:18,349 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:18,357 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:18,366 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:18,377 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:18,388 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3088 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3088) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:18,400 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3075) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3052))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_3069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_21 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_21) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3048))) (exists ((v_ArrVal_3070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3070))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_3085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3085))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2554) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3043) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2555))) (exists ((v_ArrVal_3087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3087) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3082))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3055))) (exists ((v_ArrVal_3049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3090))) (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3047) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3042) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3089) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3081) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3084 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3084) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3045) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3086) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3080) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3044))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3072) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3088 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3088) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3078))) (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3073 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3073) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_3091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3091))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3054) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.offset|))) is different from true [2021-12-06 17:18:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:24,886 INFO L93 Difference]: Finished difference Result 1896 states and 2055 transitions. [2021-12-06 17:18:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:18:24,886 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 86 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 110 [2021-12-06 17:18:24,886 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2021-12-06 17:18:24,886 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 86 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 110